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 2, 2026 16:55zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 21:55Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 21:55011,080,9801,045,0002,214,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 21:55011,245,4511,044,0002,106,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 21:55011,033,6581,049,0002,251,0002,121,728expected "16384 ", got "349 "stderr
4Jan 2, 2026 16:553,392140,380,288109,933,0001,998,0002,416,640
5Jan 2, 2026 16:553,460133,440,181111,186,0003,005,0002,502,656
6Jan 2, 2026 16:553,463133,467,413113,287,0001,002,0002,420,736