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 30, 2025 17:24zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 08:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 08:35021,251,4845,413,0007,842,0002,121,728expected "16384 ", got "786 "stderr
2Jul 5, 2026 08:35021,125,7885,424,0007,771,0002,121,728expected "16384 ", got "786 "stderr
3Jul 5, 2026 08:35021,114,0555,466,0007,655,0002,121,728expected "16384 ", got "786 "stderr
4Dec 30, 2025 17:243,734148,057,496114,196,0009,015,0002,519,040
5Dec 30, 2025 17:243,747154,263,408114,682,0008,975,0002,539,520
6Dec 30, 2025 17:243,759148,631,950114,044,00010,003,0002,281,472