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 listJan 1, 2026 17:18zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 03:23Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 03:24011,025,6211,550,0001,552,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 03:24010,938,0161,509,0001,509,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 03:24010,957,0601,543,0001,543,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 17:183,451137,564,075110,902,0002,997,0002,412,544
5Jan 1, 2026 17:183,587138,277,243117,362,0001,003,0002,420,736
6Jan 1, 2026 17:183,770147,624,015122,412,0002,006,0002,273,280