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 9, 2026 02:55zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 11:14Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 11:15010,921,8781,542,0001,542,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 11:15010,954,0411,042,0002,134,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 11:15010,799,0401,041,0002,219,0002,121,728expected "16384 ", got "349 "stderr
4Jan 9, 2026 02:553,045125,715,112100,491,00002,416,640
5Jan 9, 2026 02:553,225128,569,828104,412,0002,007,0002,535,424
6Jan 9, 2026 02:553,241129,853,719104,941,0001,998,0002,535,424