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 03:39zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 10:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 10:50010,925,3091,038,0002,092,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 10:50010,944,1621,521,0001,521,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 10:50010,996,6991,528,0001,528,0002,121,728expected "16384 ", got "349 "stderr
4Jan 7, 2026 03:393,106134,455,761100,494,0002,009,0002,535,424
5Jan 7, 2026 03:393,212127,088,649103,988,0001,999,0002,502,656
6Jan 7, 2026 03:393,309132,164,233106,180,0003,005,0002,404,352