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 7, 2026 19:07zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 00:17Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 00:18011,316,8421,094,0002,333,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 00:18011,401,6221,228,0002,468,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 00:18011,875,9031,090,0002,424,0002,121,728expected "16384 ", got "349 "stderr
4Jan 7, 2026 19:073,328132,353,832105,841,0003,994,0002,514,944
5Jan 7, 2026 19:073,518139,850,141113,088,0003,002,0002,404,352
6Jan 7, 2026 19:073,661142,056,729118,822,0001,997,0002,408,448