import timeit
# Find the thirteen adjacent digits in the 1000-digit
# number that have the greatest product. What is the value of this product?
i = """73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450"""

i = i.replace('\n','')

def solution(n, v):
    i = 1
    l = []
    for digit in n[:-v]:
        l.append(reduce(lambda x,y:int(x)*int(y), n[i:i+v], 1))
        i = i + 1
    return max(l)

# Optimized to check for 0's and skip the work.
def solution2(n, v):
    i = 1
    l = []
    # n[:-v] because we don't want to loop past the
    # list boundaries.
    _reduce = reduce
    for digit in n[:-v]:
        # No use doing anything if there's a
        # 0 in the sequence.
        _range = n[i:i+v]
        if '0' not in _range:
            l.append(_reduce(lambda x,y:int(x)*int(y), _range, 1))
        i = i + 1
    return max(l)

start = timeit.default_timer()
print solution(i, 13)
end = timeit.default_timer()
print "Ran in", end - start, "seconds."

start = timeit.default_timer()
print solution2(i, 13)
end = timeit.default_timer()
print "Ran in", end - start, "seconds."
