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 17, 2025 18:18Rajarshi BasuRajarshi BasuScore: 12,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 18:2412,417435,776,594404,749,0004,996,0002,506,752
2Dec 17, 2025 18:2912,526438,064,074404,356,0009,007,0002,355,200
3Dec 17, 2025 18:2912,615446,067,121408,293,0007,986,0002,510,848
4Dec 17, 2025 18:2412,824450,075,961413,199,0009,980,0002,510,848
5Dec 17, 2025 18:2412,991459,446,032419,715,0008,993,0002,359,296
6Dec 17, 2025 18:2913,688480,268,583443,704,0007,994,0002,531,328
7Dec 17, 2025 18:1814,956523,708,134481,567,00011,989,0002,453,504
8Dec 17, 2025 18:1815,324534,703,899496,703,0008,994,0002,383,872
9Dec 17, 2025 18:1815,891553,864,223513,424,00010,987,0002,396,160