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 listMay 14, 2026 23:39flavio87flavio87Score: 201,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 23:40201,1466,648,839,3046,589,415,00048,424,0002,113,536
2May 14, 2026 23:40201,9166,672,907,3836,614,523,00048,712,0002,113,536
3May 14, 2026 23:40203,3856,721,400,9876,663,073,00048,648,0002,113,536