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
Back to listDec 5, 2025 11:27CadovvlCadovvlScore: 36,825Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 11:2736,2181,220,202,7901,182,196,00013,002,0002,457,600
2Dec 5, 2025 11:2736,8251,242,533,4671,205,223,0009,993,0002,453,504
3Dec 5, 2025 11:2737,4531,263,888,2061,220,970,00014,987,0002,506,752