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: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 23, 2026 20:110593,464,333578,832,0004,867,0002,113,536expected "1021032 ", got "1020768 "
2Jul 23, 2026 20:110596,879,736581,848,0005,142,0002,113,536expected "1021002 ", got "1020759 "
3Jul 23, 2026 20:110597,871,398582,811,0005,216,0002,113,536expected "1025152 ", got "1024895 "