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 01:09zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 06:06Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 06:06010,883,9971,036,0002,091,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 06:06010,740,0071,520,0001,520,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 06:06010,753,6251,042,0002,104,0002,121,728expected "16384 ", got "349 "stderr
4Jan 9, 2026 01:093,128121,711,528102,216,0001,002,0002,273,280
5Jan 9, 2026 01:093,137127,592,626101,513,0002,010,0002,273,280
6Jan 9, 2026 01:093,146132,263,418102,820,000998,0002,535,424