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 1, 2026 15:19Alexander KrivolapovAlexander KrivolapovScore: 29,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 15:1929,075985,827,378952,471,0006,996,0002,318,336
2Mar 1, 2026 15:1929,400997,964,543962,212,0007,993,0002,424,832
3Mar 1, 2026 15:1930,1721,019,160,175990,699,0004,993,0002,408,448