Project euler #18 - Maximum path sum I  (Python)
Leetness: 1  

temp = """75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23"""

t = map(lambda x: map(int, x.split()), temp.split('\n'))

def maxsum(sum, line):
    #print 'sum:', sum
    #print 'line:', line
    a = map(lambda x: x[0]+x[1], zip(sum, line))
    #print 'a:', a
    b = map(lambda x: x[0]+x[1], zip(sum[1:], line))
    #print 'b:', b
    return map(max, zip(a, b))

solutions = [lambda : reduce(maxsum, t[::-1])[0]]

     
Submitted on August 22, 2014 by Anonymous
https://github.com/tristan/project-euler-code