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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 02:32Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 02:32011,066,1061,037,0002,079,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 02:32012,312,6371,043,0002,162,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 02:32010,968,8421,522,0001,521,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 17:503,556140,253,369115,333,0002,005,0002,416,640
5Jan 1, 2026 17:503,574143,464,309115,934,0001,998,0002,416,640
6Jan 1, 2026 17:503,731146,738,011121,115,0002,001,0002,416,640