User:Mido1236/Chop Ahoy! Revisited!

Thanks to the string length limit, you could easily get away with a straightforward backtracking solution (2^24 = 64 million, which is no problem). At every number in the string, you could either append it to the current subgroup, or start a new one. If you decide to start a new one, check if the current subgroup that will be closed has a "sum of digits" larger than the subgroup before it (if any), as you could start a new subgroup only if this holds. When you reach the end of the string, do the same check, and if successfull, increcment a counter (I used a global one). The final value of the counter is the answer.