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 listDec 17, 2025 18:40Rajarshi BasuRajarshi BasuScore: 11,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 18:4011,110400,559,878359,626,0006,992,0002,531,328
2Dec 17, 2025 18:4011,144396,429,097362,752,0004,996,0002,490,368
3Dec 17, 2025 18:4011,560405,964,336375,489,0005,991,0002,506,752