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 22, 2025 19:21zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:48Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:48011,059,6321,667,0001,666,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 14:48011,094,7401,655,0001,655,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 14:48011,054,4541,581,0001,581,0002,121,728expected "16384 ", got "32 "stderr
4Dec 22, 2025 19:214,503173,784,770133,637,00014,959,0002,490,368
5Dec 22, 2025 19:214,552171,546,011138,201,00012,017,0002,326,528
6Dec 22, 2025 19:214,780183,495,551142,776,00014,976,0002,306,048