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 7, 2026 03:59zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 14:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:49011,139,6911,007,0002,030,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 14:49010,719,4681,010,0002,017,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 14:49011,086,6611,495,0001,496,0002,121,728expected "16384 ", got "349 "stderr
4Jan 7, 2026 03:593,214127,677,407103,045,0003,001,0002,535,424
5Jan 7, 2026 03:593,282133,700,457106,293,0002,005,0002,535,424
6Jan 7, 2026 03:593,287131,708,004107,474,0001,004,0002,400,256