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 24, 2026 21:57boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 21:580213,110,570194,940,0005,691,0002,113,536expected "1022896 ", got "15 "
2Jul 24, 2026 21:580211,840,612194,491,0007,591,0002,113,536expected "1018941 ", got "15 "
3Jul 24, 2026 21:580212,572,737194,163,0008,634,0002,113,536expected "1023091 ", got "15 "