Euler8.py

num = "731671765313306249192251196744265747423553491949349698352031277450632623957831801698480186947885184385861560789112949495459501737958331952853208805511"\
"125406987471585238630507156932909632952274430435576689664895044524452316173185640309871112172238311362229893423380308135336276614282806444486645238749"\
"303589072962904915604407723907138105158593079608667017242712188399879790879227492190169972088809377665727333001053367881220235421809751254540594752243"\
"525849077116705560136048395864467063244157221553975369781797784617406495514929086256932197846862248283972241375657056057490261407972968652414535100474"\
"821663704844031998900088952434506585412275886668811642717147992444292823086346567481391912316282458617866458359124566529476545682848912883142607690042"\
"242190226710556263211111093705442175069416589604080719840385096245544436298123098787992724428490918884580156166097919133875499200524063689912560717606"\
"0588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"

index = 0
greatest = 0
product = 1
for i in num:
	for j in xrange(index, index+13): #iterates through the next 13 adjacent numbers
		if num[j] == "0":
			break
		product *= int(num[j])
	if product > greatest:
		greatest = product
	index += 1
	product = 1
print greatest