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 04:34Josu San MartinJosu San MartinScore: 591,196Success
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:34589,93019,509,896,08719,028,954,000438,722,0002,514,944
2Dec 22, 2025 04:34591,19619,551,666,17019,069,800,000439,672,0002,404,352
3Dec 22, 2025 04:34595,43219,697,437,40419,219,639,000429,611,0002,289,664