Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
def main():
    n = int(input())
    ans = 0
    for i in range(1,n+1):
        #print(np.arange(i,n+1,i),np.arange(i,n,i).sum())
        ans += np.arange(i,n+1,i).sum()

    print(ans)
main()

Fixed submission:
def main():
    n = int(input())
    ans = 0
    for i in range(1,n+1):
        #print(range(i,n+1,i),sum(range(i,n+1,i)))
        ans += sum(range(i,n+1,i))

    print(ans)
main()

Buggy python submission (verdict: Runtime Error):
import numpy as np
def main():
    n = int(input())
    ans = 0
    for i in range(1,n+1):
        #print(np.arange(i,n+1,i),np.arange(i,n,i).sum())
        ans += np.arange(i,n+1,i).sum()

    print(ans)
main()

Fixed submission:
def main():
    n = int(input())
    ans = 0
    for i in range(1,n+1):
        #print(range(i,n+1,i),sum(range(i,n+1,i)))
        ans += sum(range(i,n+1,i))

    print(ans)
main()

Buggy python submission (verdict: Time Limit Exceeded):
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr

def k(n):
    s=1
    arr = factorization(n)
    for i in range(len(arr)):
        s *= (arr[i][1] + 1)
    return s

def main():
    n = int(input())
    s = 0
    
    #print(arr)
    for i in range(2,n+1):
        s += i * k(i)
    s += 1
    print(s)
main()

Fixed submission:
def main():
    n = int(input())
    ans = 0
    for i in range(1,n+1):
        #print(range(i,n+1,i),sum(range(i,n+1,i)))
        ans += sum(range(i,n+1,i))

    print(ans)
main()

Buggy python submission (verdict: Time Limit Exceeded):
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    return len(divisors)

def main():
    n = int(input())
    s = 0
    
    for i in range(1,n+1):
        s += i * make_divisors(i)
    print(s)

main()

Fixed submission:
def main():
    n = int(input())
    ans = 0
    for i in range(1,n+1):
        #print(range(i,n+1,i),sum(range(i,n+1,i)))
        ans += sum(range(i,n+1,i))

    print(ans)
main()

Buggy python submission (verdict: Runtime Error):
def main():
    import sympy
    n = int(input())
    s = 0
    
    for i in range(1,n+1):
        s += i * len(sympy.divisors(i))
    print(s)

main()

Fixed submission:
def main():
    n = int(input())
    ans = 0
    for i in range(1,n+1):
        #print(range(i,n+1,i),sum(range(i,n+1,i)))
        ans += sum(range(i,n+1,i))

    print(ans)
main()

Buggy python submission (verdict: Runtime Error):
def main():
    import sympy
    n = int(input())
    s = 0
    
    for i in range(1,n+1):
        s += i * len(sympy.divisors(i))
    print(s)

main()

Fixed submission:
def main():
    n = int(input())
    ans = 0
    for i in range(1,n+1):
        #print(range(i,n+1,i),sum(range(i,n+1,i)))
        ans += sum(range(i,n+1,i))

    print(ans)
main()