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 20, 2025 16:06Rajarshi BasuRajarshi BasuScore: 5,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 16:075,155192,529,680163,119,0007,005,0002,420,736
2Dec 20, 2025 16:075,157196,110,106167,186,0003,003,0002,400,256
3Dec 20, 2025 16:065,172201,890,268166,690,0003,992,0002,342,912
4Dec 20, 2025 16:065,174191,999,687164,743,0005,990,0002,506,752
5Dec 20, 2025 16:075,182194,945,923164,006,0007,000,0002,519,040
6Dec 20, 2025 16:065,204198,356,160165,753,0005,991,0002,293,760