Let's define a function countUniqueChars(s) that returns the number of unique characters on s, for example if s = "LEETCODE" then "L", "T","C","O","D" are the unique characters since they appear only once in s, therefore countUniqueChars(s) = 5.

On this problem given a string s we need to return the sum of countUniqueChars(t) where t is a substring of s. Notice that some substrings can be repeated so on this case you have to count the repeated ones too.
Since the answer can be very large, return the answer modulo 10 ^ 9 + 7.
 
Example 1:
Input: s = "ABC"
Output: 10
Explanation: All possible substrings are: "A","B","C","AB","BC" and "ABC".
Evey substring is composed with only unique letters.
Sum of lengths of all substring is 1 + 1 + 1 + 2 + 2 + 3 = 10

Example 2:
Input: s = "ABA"
Output: 8
Explanation: The same as example 1, except countUniqueChars("ABA") = 1.

Example 3:
Input: s = "LEETCODE"
Output: 92

 
Constraints:

0 <= s.length <= 10^4
s contain upper-case English letters only.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '# from collections import defaultdict\n# class Solution(object):\n#     def uniqueLetterString(self, s):\n#         \\"\\"\\"\n#         :type S: str\n#         :rtype: int\n#         \\"\\"\\"\n#         dic = defaultdict(list)\n#         for i,letter in enumerate(s):\n#             dic[letter].append(i)\n        \n#         pos = {letter:0 for letter in dic.keys()}\n#         res = 0\n#         for i,letter in enumerate(s):\n#             idx = pos[letter]\n            \n#             if idx - 1 >= 0:\n#                 left = dic[letter][idx - 1] + 1\n#             else:\n#                 left = 0\n#             if idx + 1 <= len(dic[letter]) - 1:\n#                 right = dic[letter][idx + 1] - 1\n#             else:\n#                 right = len(s) - 1\n            \n#             res += (i - left + 1) * (right - i + 1)\n#             pos[letter] += 1\n        \n#         return res % (10 ** 9 +7)\nfrom collections import defaultdict\nclass Solution(object):\n    def uniqueLetterString(self,S):\n        # write your code in Python 3.6\n        dictionary = dict()\n\n        for i in range(len(S)):\n            if dictionary.get(S[i]):\n                dictionary[S[i]].append(i)\n            else:\n                dictionary[S[i]] = [i]\n        position = dict()\n        for letter in dictionary.keys():\n            position[letter]=0\n        result = 0\n        for index, letter in enumerate(S):\n            i = position[letter]\n            if i-1>=0:\n                l = dictionary[letter][i-1]+1\n            else:\n                l=0\n            if i+1 <= len(dictionary[letter])-1:\n                r = dictionary[letter][i+1]-1\n            else:\n                r = len(S) - 1\n\n            result += ((index-l+1) * (r-index +1)) % 1000000007\n            position[letter]+=1\n        return result % 1000000007'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'uniqueLetterString'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6472