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 listJul 23, 2026 20:12boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 20:130560,472,917542,630,0006,237,0002,113,536expected "1022628 ", got "1022404 "
2Jul 23, 2026 20:130557,306,011539,749,0007,760,0002,113,536expected "1020416 ", got "1020188 "
3Jul 23, 2026 20:130557,183,254539,477,0007,931,0002,113,536expected "1022379 ", got "1022159 "