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 listOct 17, 2026 00:00zayd-ansari-codezayd-ansari-codeScore: 192,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 00:01191,6236,334,736,4016,274,598,00048,980,0002,113,536
2Oct 17, 2026 00:01192,9186,377,291,0396,317,616,00048,687,0002,113,536
3Oct 17, 2026 00:01193,9196,410,238,0586,349,975,00049,383,0002,113,536