Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens

A generator is a program that produces test data and expected results for a challenge. Each time a solution is checked, the generator runs fresh - producing unique, unpredictable input.

Custom generators let you challenge other participants' solutions with your own test cases. If someone's solution fails on your generator's input, it exposes weaknesses in their approach. Writing good generators requires deep understanding of the problem - you need to craft edge cases, stress tests, and tricky inputs that push solutions to their limits.

Log in to create generators.