Leetcode 3167. Better Compression of String

Given a string composed of character–count pairs (with counts possibly multi-digit and the same character appearing multiple times), parse and sum counts for each character, then return a compressed string listing each character once with its total count, typically sorted lexicographically.