Project Euler 10(Python) | Summation of Primes

Question

This is my Python3 code which solved the 10th problem of Project Euler. I haven't passed the last 2 time limit test cases.

def sieve_of_eratosthenes(n):
    result = [True] * (n + 1)
    result[0] = result[1] = False
    for i in range(2, int(n**0.5)+1):
        if result[i]:
            for j in range(i*i, n+1, i):
                result[j] = False
    return [i for i in range(n+1) if result[i]]
    
t = int(input().strip())
for a0 in range(t):
    n = int(input().strip())
    result_arr = sieve_of_eratosthenes(n)
    result = sum(result_arr)
    print(result)

Answer 1

It was clarified that this problem is the Hacker Rank version: https://www.hackerrank.com/contests/projecteuler/challenges/euler010/problem

This problem has the format of multiple test cases being solved in one run. The format itself suggests an approach: pre-calculate something once, then use that to solve all cases. You could first find the highest N (there is no requirement to answer the cases one by one as you read them, you can read them all first and then start answering them), or else just pre-calculate for the worst case, N only goes up to a million anyway, no big deal.

For this problem you can pre-calculate something such that you can answer each test case in constant time.