I was thinking on the same approach, good to know it might not be the most efficient. Now I am thinking of calculating the sum for each path at a time and compare its value the one from the previous path and keep the bigger one. There should be no problems of not having enough memory.

i wonder why you know this trick, i feel there are many weird terms of math linear
great solution