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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 01:32Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 01:33010,957,5321,043,0002,148,0002,121,728expected "16384 ", got "349 "stderr
2Jul 5, 2026 01:33011,060,7961,043,0002,177,0002,121,728expected "16384 ", got "349 "stderr
3Jul 5, 2026 01:33011,045,8021,044,0002,297,0002,121,728expected "16384 ", got "349 "stderr
4Jan 1, 2026 17:433,505140,042,289113,673,0001,994,0002,535,424
5Jan 1, 2026 17:433,547138,100,744115,060,0002,001,0002,416,640
6Jan 1, 2026 17:433,590153,511,300118,484,00002,412,544