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 listJun 25, 2025 00:17Ian MckibbenIan MckibbenScore: 575,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 00:17570,74418,882,343,21318,760,628,00073,919,0002,437,120
2Jun 25, 2025 00:17575,83119,046,052,49318,920,495,00081,924,0002,359,296
3Jun 25, 2025 00:17576,67119,078,486,42118,950,207,00079,920,0002,285,568