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 listNov 15, 2025 22:21Aniruddha DebAniruddha DebScore: 13,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2025 22:2113,527476,642,046413,433,00032,954,0002,519,040
2Nov 15, 2025 22:2113,616479,275,636417,383,00031,952,0002,269,184
3Nov 15, 2025 22:2113,728488,241,548426,020,00027,001,0002,461,696