The problem is to realize that to get the time down, your starting sum needs to be as big as possible.

So, start by sorting the array from largest to smallest. Then, just loop through every possible group size, from one number up to all of them. For each group size m, sum the top m numbers. See if your target value X is bigger than that sum. If it is, check if the difference can be divided evenly by m.