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 09:01Rajarshi BasuRajarshi BasuScore: 5,220Success
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 09:015,193202,965,561164,370,0007,015,0002,318,336
2Dec 20, 2025 09:015,201201,821,738166,632,0004,988,0002,461,696
3Dec 20, 2025 09:015,201198,795,698164,655,0006,985,0002,293,760
4Dec 20, 2025 09:015,217199,131,229169,153,0003,002,0002,449,408
5Dec 20, 2025 09:015,220194,413,650166,242,0006,008,0002,514,944
6Dec 20, 2025 09:015,222194,122,203165,303,0007,012,0002,404,352
7Dec 20, 2025 09:015,231203,409,545166,634,0005,986,0002,527,232
8Dec 20, 2025 09:015,265195,154,180167,758,0005,991,0002,502,656
9Dec 20, 2025 09:015,359201,117,150171,845,0004,995,0002,494,464