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 22, 2025 15:02Josu San MartinJosu San MartinScore: 36,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 04:2834,8931,182,293,1831,136,487,00014,993,0002,404,352
2Dec 22, 2025 15:0235,4411,192,880,3371,152,556,00016,993,0002,281,472
3Dec 22, 2025 04:2836,0041,221,827,5721,169,144,00018,986,0002,285,568
4Dec 22, 2025 15:0236,6171,239,919,5571,191,385,00016,976,0002,277,376
5Dec 22, 2025 15:0236,8501,243,795,6691,197,074,00018,985,0002,461,696
6Dec 22, 2025 04:2837,0651,254,370,7341,207,165,00015,988,0002,285,568