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 9, 2026 13:47Alexander KrivolapovAlexander KrivolapovScore: 38,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 13:4738,8591,309,341,9891,137,410,000144,924,0002,510,848
2Mar 9, 2026 13:4738,9811,312,592,4301,146,537,000139,821,0002,351,104
3Mar 9, 2026 13:4739,5421,327,107,1481,155,024,000149,873,0002,441,216