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 listMar 2, 2026 20:32Alexander KrivolapovAlexander KrivolapovScore: 69,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 20:3269,6992,332,004,0082,290,068,0009,991,0002,453,504
2Mar 2, 2026 20:3269,8682,335,023,7322,296,646,0008,990,0002,293,760
3Mar 2, 2026 20:3269,8802,331,946,9182,295,035,00010,990,0002,453,504