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 15:25zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 03:01Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 03:0109,897,31001,997,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 03:01010,081,79402,003,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 03:0109,801,92801,903,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 15:253,550137,378,484115,161,0002,002,0002,383,872
5Jan 1, 2026 15:253,584143,627,976115,270,0003,007,0002,482,176
6Jan 1, 2026 15:253,741151,768,693121,437,0002,007,0002,334,720