Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
One-liner solution in Creative category for Golden Pyramid by altarfinch
count_gold = lambda p: p[0][0] if len(p) == 1 else count_gold(list(p[:-2]) + [[p[-2][i] + max(p[-1][i],p[-1][i+1]) for i in range(len(p)-1)]])
Feb. 10, 2015