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 18:02zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 06:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 06:29010,948,4161,547,0001,548,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 06:29011,039,7841,045,0002,150,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 06:29011,332,1221,042,0002,220,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 18:023,604139,850,737116,939,0001,998,0002,416,640
5Jan 1, 2026 18:023,664147,469,212118,918,0001,998,0002,416,640
6Jan 1, 2026 18:023,760144,748,866122,094,0002,001,0002,506,752