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 11, 2026 01:44Josu San MartinJosu San MartinScore: 4,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 01:444,723176,456,066153,851,0001,998,0002,404,352
2Jan 11, 2026 01:444,726180,142,365152,950,0002,999,0002,519,040
3Jan 11, 2026 01:444,728182,010,263154,022,0002,000,0002,400,256