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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 16:46Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 16:46010,942,9971,042,0002,170,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 16:46011,412,4241,041,0002,182,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 16:46010,988,7051,044,0002,138,0002,121,728expected "16384 ", got "349 "stderr
4Jan 4, 2026 17:143,308133,807,757106,147,0003,004,0002,535,424
5Jan 4, 2026 17:143,327135,452,605108,809,000998,0002,408,448
6Jan 4, 2026 17:143,363139,332,008108,972,0001,999,0002,535,424