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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 10:32Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 10:34011,082,5731,033,0002,077,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 10:34011,017,2861,043,0002,102,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 10:34011,304,4481,044,0002,138,0002,121,728expected "16384 ", got "349 "stderr
4Jan 4, 2026 17:183,176139,091,026102,796,0001,996,0002,412,544
5Jan 4, 2026 17:183,208129,117,090104,854,000998,0002,535,424
6Jan 4, 2026 17:183,243128,014,696106,019,0001,000,0002,412,544