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 17:16zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 04:52Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 04:52011,630,4231,041,0002,178,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 04:52011,345,2441,529,0001,529,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 04:52011,063,0631,041,0002,192,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 17:163,586142,847,078115,334,0003,008,0002,416,640
5Jan 1, 2026 17:163,642145,646,201118,179,0002,003,0002,273,280
6Jan 1, 2026 17:163,818153,524,448123,981,0001,999,0002,412,544