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 10, 2026 23:46zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 04:29Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 04:29011,276,9061,041,0002,127,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 04:29011,294,7331,042,0002,112,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 04:29010,915,1471,039,0002,107,0002,121,728expected "16384 ", got "349 "stderr
4Jan 10, 2026 23:463,012119,924,72798,408,0001,004,0002,408,448
5Jan 10, 2026 23:463,108128,275,462102,549,00002,420,736
6Jan 10, 2026 23:463,149124,889,845102,927,000999,0002,412,544