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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 07:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 07:50010,963,9441,043,0002,197,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 07:50011,018,3271,050,0002,103,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 07:50011,110,1231,038,0002,115,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 16:573,696143,009,433119,965,0001,999,0002,412,544
5Jan 1, 2026 16:573,717145,726,785120,669,0001,994,0002,420,736
6Jan 1, 2026 16:573,721142,816,654120,808,0001,996,0002,412,544