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 20:44zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:46Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:47010,975,4681,596,0001,596,0002,121,728expected "16384 ", got "32 "stderr
2Jul 5, 2026 14:47011,120,2841,651,0001,652,0002,121,728expected "16384 ", got "32 "stderr
3Jul 5, 2026 14:47011,052,9451,660,0001,659,0002,121,728expected "16384 ", got "32 "stderr
4Dec 22, 2025 20:444,384174,005,143140,682,0003,990,0002,281,472
5Dec 22, 2025 20:444,430171,599,193138,190,0008,011,0002,498,560
6Dec 22, 2025 20:444,437169,020,029133,370,00013,036,0002,420,736