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

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 06:36Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 06:36010,907,8451,043,0002,159,0002,121,728expected "16384 ", got "353 "stderr
2Jul 5, 2026 06:36010,953,4391,047,0002,170,0002,121,728expected "16384 ", got "353 "stderr
3Jul 5, 2026 06:36011,117,0741,042,0002,233,0002,121,728expected "16384 ", got "353 "stderr
4Jan 1, 2026 16:443,610146,694,288117,128,0002,002,0002,424,832
5Jan 1, 2026 16:443,669143,266,795118,087,0003,002,0002,412,544
6Jan 1, 2026 16:443,680154,909,750121,435,00002,416,640