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 25, 2025 23:01zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 14:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:44011,596,0592,545,0001,272,0002,121,728expected "16384 ", got "353 "stderr
2Jul 5, 2026 14:44011,692,1012,635,0001,317,0002,121,728expected "16384 ", got "353 "stderr
3Jul 5, 2026 14:44013,044,6592,646,0001,322,0002,121,728expected "16384 ", got "353 "stderr
4Dec 25, 2025 23:014,357170,803,244135,788,0007,987,0002,482,176
5Dec 25, 2025 23:014,393168,022,771132,978,00011,998,0002,461,696
6Dec 25, 2025 23:014,404166,606,835129,302,00016,037,0002,412,544