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 listOct 17, 2026 21:19e1011e1011Score: 64,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 21:2164,2732,132,133,4882,112,383,0008,637,0002,113,536
2Oct 17, 2026 21:2164,3642,135,173,1162,115,275,0008,747,0002,113,536
3Oct 17, 2026 21:2164,7482,148,157,9242,128,022,0008,671,0002,113,536
4Oct 17, 2026 21:2164,8562,151,393,3512,131,563,0008,706,0002,113,536
5Oct 17, 2026 21:2164,8842,152,242,3002,132,459,0008,713,0002,113,536
6Oct 17, 2026 21:2165,1922,165,379,2302,142,627,0008,717,0002,113,536
7Oct 17, 2026 21:2165,4192,169,851,8422,150,109,0008,728,0002,113,536
8Oct 17, 2026 21:2167,2792,231,425,3302,211,340,0008,887,0002,113,536
9Oct 17, 2026 21:2167,3932,235,075,6242,215,342,0008,632,0002,113,536