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 11, 2025 15:02Rajarshi BasuRajarshi BasuScore: 28,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:0228,514966,248,138931,969,0008,999,0002,367,488
2Dec 11, 2025 15:0228,739973,519,763939,397,0008,994,0002,297,856
3Dec 11, 2025 15:0228,801980,858,362945,434,0004,997,0002,519,040
4Dec 11, 2025 15:0228,930982,235,407948,677,0005,997,0002,437,120
5Dec 11, 2025 15:0228,953983,845,932946,463,0008,994,0002,383,872
6Dec 11, 2025 15:0229,126988,961,762949,173,00011,989,0002,400,256
7Dec 11, 2025 15:0229,6641,009,125,970967,930,00010,987,0002,478,080
8Dec 11, 2025 15:0230,6421,039,614,629996,200,00014,972,0002,310,144
9Dec 11, 2025 15:0231,9331,080,499,9591,043,795,0009,988,0002,351,104