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 listDec 31, 2025 00:44zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 07:13Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 07:13021,412,7835,650,0007,827,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 07:13021,218,9965,529,0007,664,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 07:13021,567,1655,536,0008,134,0002,121,728expected "16384 ", got "786 "stderr
4Dec 31, 2025 00:443,668145,464,808112,027,0009,002,0002,367,488
5Dec 31, 2025 00:443,693152,715,087116,867,0004,994,0002,363,392
6Dec 31, 2025 00:443,717142,700,295112,696,0009,973,0002,404,352