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 listJan 9, 2026 15:17Pavel SkripkinPavel SkripkinScore: 67,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 15:1766,9032,234,357,3452,198,795,0008,995,0002,281,472
2Jan 9, 2026 15:1767,5862,261,437,0142,220,330,0009,992,0002,281,472
3Jan 9, 2026 15:1769,7822,327,066,6862,294,812,0007,995,0002,326,528