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 9, 2026 01:39zielajzielajError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 14:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:50010,807,6651,508,0001,510,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 14:50010,927,3911,538,0001,540,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 14:50010,864,0751,040,0002,138,0002,121,728expected "16384 ", got "349 "stderr
4Jan 9, 2026 01:393,196127,881,420104,470,0001,004,0002,404,352
5Jan 9, 2026 01:393,286129,772,435108,453,00002,273,280
6Jan 9, 2026 01:393,308132,367,967108,170,0001,001,0002,412,544