#C2688. Counting Unique Characters
Counting Unique Characters
Counting Unique Characters
This problem requires you to count the number of unique characters in each given string. For a string \( s \), you are to compute \( |U(s)| \), where \( U(s) \) is the set of unique characters contained in \( s \). The input will begin with an integer \( T \) representing the number of strings, followed by \( T \) lines where each line contains a single string. Your task is to output the number of unique characters for each string on a separate line.
inputFormat
The first line contains an integer \( T \) denoting the number of strings. Each of the next \( T \) lines contains one string that may include any characters.
outputFormat
Output \( T \) lines. Each line must contain a single integer representing the number of unique characters in the corresponding input string.
## sample3
hello
world
Programming
4
5
8
</p>