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 2, 2026 21:13zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 15:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 15:11010,985,4841,524,0001,523,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 15:11010,968,5531,045,0002,160,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 15:11011,020,5181,512,0001,514,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 21:133,275131,470,321105,086,0003,002,0002,420,736
5Jan 2, 2026 21:133,296134,807,739106,785,0001,995,0002,412,544
6Jan 2, 2026 21:133,318139,564,352108,496,0001,004,0002,412,544