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 04:26Rajarshi BasuRajarshi BasuScore: 5,764Success
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 04:265,747212,532,470182,671,0006,987,0002,420,736
2Dec 20, 2025 04:265,757213,137,226186,972,0002,999,0002,510,848
3Dec 20, 2025 04:265,759211,853,895184,037,0006,001,0002,514,944
4Dec 20, 2025 04:265,763214,549,304184,159,0006,005,0002,465,792
5Dec 20, 2025 04:265,764214,908,974184,217,0006,007,0002,510,848
6Dec 20, 2025 04:265,779216,839,446185,727,0004,992,0002,269,184
7Dec 20, 2025 04:265,797224,096,801186,285,0005,007,0002,473,984
8Dec 20, 2025 04:265,825212,667,826187,222,0005,005,0002,383,872
9Dec 20, 2025 04:266,013222,702,506193,455,0004,985,0002,412,544