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 1, 2026 16:20zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 03:53Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 03:53010,971,7101,509,0001,509,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 03:53011,481,1081,044,0002,150,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 03:53011,316,0301,042,0002,165,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 16:203,479139,102,964113,812,000998,0002,416,640
5Jan 1, 2026 16:203,612147,989,278116,176,0003,004,0002,420,736
6Jan 1, 2026 16:203,649149,564,612119,410,0001,003,0002,502,656