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 22, 2026 20:11boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 20:120571,412,143560,534,0001,003,0002,113,536expected "1025979 ", got "1025711 "
2Jul 22, 2026 20:120572,442,396560,781,0001,003,0002,113,536expected "1021679 ", got "1022594 "
3Jul 22, 2026 20:120571,530,779560,693,0001,005,0002,113,536expected "1022187 ", got "1023791 "