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 04:00zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 11:22Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 11:24010,878,0551,038,0002,050,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 11:24010,954,8651,053,0002,081,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 11:24010,839,8091,029,0002,015,0002,121,728expected "16384 ", got "349 "stderr
4Jan 7, 2026 04:003,191125,977,241103,297,0002,005,0002,404,352
5Jan 7, 2026 04:003,228135,199,677106,526,00002,535,424
6Jan 7, 2026 04:003,231134,579,641106,608,00002,412,544