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 31, 2025 06:52Rajarshi BasuRajarshi BasuScore: 3,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 06:523,882154,640,242125,108,0003,002,0002,293,760
2Dec 31, 2025 06:523,897157,798,194124,629,0003,988,0002,355,200
3Dec 31, 2025 06:523,908152,187,151124,963,0003,998,0002,514,944
4Dec 31, 2025 06:523,909153,525,135125,013,0004,000,0002,297,856
5Dec 31, 2025 06:523,920155,584,151125,357,0004,011,0002,269,184
6Dec 31, 2025 06:523,921160,955,115125,381,0004,012,0002,297,856
7Dec 31, 2025 06:523,928156,898,882126,647,0002,991,0002,514,944
8Dec 31, 2025 06:523,936153,166,863126,907,0002,997,0002,514,944
9Dec 31, 2025 06:523,958161,293,194126,613,0003,987,0002,494,464