more efficient method of dealing with large numbers in Python?
<p>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.</p>

<p>I cant use functions, recursions, only basic stuff..</p>

<p>The question is:</p>

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

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

<pre><code>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=0
    for j in new:
        l=l+int(j)
    print(i)
    print(new)
    print(l)
    print()
    if l&gt;sumOfBig:
        sumOfBig=l
        Big=new
print(Big)
print(sumOfBig)
</code></pre>

<p>Do you guys have any ideas for better code?</p>
