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 15, 2025 13:23Rajarshi BasuRajarshi BasuScore: 14,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 13:2314,756515,661,650475,937,00010,998,0002,367,488
2Dec 15, 2025 13:2314,785510,842,475476,895,00010,997,0002,379,776
3Dec 15, 2025 13:2314,902518,103,950481,777,0009,995,0002,351,104