I have a question in Python which I have created an answer for it, but I am trying to achieve better efficiency for the answer.

I cant use functions, recursions, only basic stuff..

The question is:

For the number 3 power 2209 there are 1000 digits. find 12 sequential numbers that it's sum is the maximal.

For example: 5 power 36 equals 14551915228366851806640625. The 12 sequential numbers that product the maximal sum are 836685180664.

sumOfBig=0
Big=""
x=5**36
strp=str(x)
s=len(strp)
print(x)
print()
for i in range(s-11):new=strp[i:i+12]l=0for j in new:l=l+int(j)print(i)print(new)print(l)print()if l>sumOfBig:sumOfBig=lBig=new
print(Big)
print(sumOfBig)

Do you guys have any ideas for better code?

well, you can have more efficient way of summing the 12 sequential numbers. you can keep track of 12 sequential numbers, pop/subtract the oldest(leftmost) one from the subset's sum, push/add the newest(rightmost) one.

also, sum(iterable) is a built-in function.

my new code with only basic list and for-loop:

x = 5 ** 36
num_list = [int(i) for i in str(x)]
sumOfBig = last_sum = sum(num_list[:12])
maximal_index = 0for i, n in enumerate(num_list[12:]):last_sum = last_sum + n - num_list[i]if last_sum > sumOfBig:maximal_index = i+1sumOfBig = last_sumprint num_list[maximal_index:maximal_index+12] #[8, 3, 6, 6, 8, 5, 1, 8, 0, 6, 6, 4]