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 14:47Rajarshi BasuRajarshi BasuScore: 5,140Success
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 14:475,110192,760,451164,651,0003,991,0002,519,040
2Dec 20, 2025 14:475,118193,640,129161,887,0006,995,0002,408,448
3Dec 20, 2025 14:475,127195,027,004166,194,0003,003,0002,519,040
4Dec 20, 2025 14:475,140194,866,795165,637,0003,991,0002,416,640
5Dec 20, 2025 14:475,153194,976,445164,045,0006,001,0002,506,752
6Dec 20, 2025 14:475,169197,241,372164,584,0005,984,0002,478,080