Total Appeal of A String

Compute the sum of distinct-character counts for all substrings of a lowercase string s (n up to 1e5). The challenge is to avoid O(n^2) brute force by using a contribution-counting technique that accumulates how many substrings each character occurrence uniquely contributes to.