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 25, 2026 18:00boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2026 18:000475,093,783461,063,0003,312,0002,113,536expected "1023780 ", got "256908 "
2Jul 25, 2026 18:000475,800,040461,596,0004,292,0002,113,536expected "1024055 ", got "256946 "
3Jul 25, 2026 18:000474,356,152460,317,0004,212,0002,113,536expected "1023950 ", got "256930 "