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

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

Challenge History
DateChallengerCostTypeStatus
Jul 4, 2026 22:32Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 22:32010,850,9581,042,0002,110,0002,121,728expected "16384 ", got "349 "stderr
2Jul 4, 2026 22:32010,964,1741,043,0002,142,0002,121,728expected "16384 ", got "349 "stderr
3Jul 4, 2026 22:32011,032,4221,547,0001,547,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 18:043,451135,282,403111,889,0001,998,0002,416,640
5Jan 1, 2026 18:043,490135,216,399113,153,0002,002,0002,535,424
6Jan 1, 2026 18:043,569145,445,278115,778,0001,996,0002,420,736