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 listJan 2, 2026 06:33Josu San MartinJosu San MartinScore: 42,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 06:3342,2941,429,840,9331,201,877,000193,819,0002,375,680
2Jan 2, 2026 06:3342,5581,427,356,1691,207,633,000196,777,0002,285,568
3Jan 2, 2026 06:3343,1211,450,957,5461,221,278,000201,715,0002,478,080