Sum оптимизиция

x = 0
for q in q_set:
     x += a[i][q] * vw[a[i][q]][q]  * wp[q]

x = sum(a[i][q] * vw[a[i][q]][q]  * wp[q]  for q in q_set)

import time
 
start = time.time()
print(sum(i for i in range(100000000)))
end = time.time()
print('Time:',end-start)
 
start = time.time()
x = 0
for i in range(100000000):
    x += i
print(x)    
end = time.time()    
print('Time:',end-start)
 
 
import numpy as np
start = time.time()
print(np.sum(np.arange(100000000),dtype=np.int64))
end = time.time()    
print('Time:',end-start)

for i in range(N):
    for j in range(N):
        for k in range(N):   
            d[k] = a[i,k] + b[k,j]
        min_val = min(d)
        min_ind = np.argmin(d)
        # using min_val and min_ind

d = [a[i,k] + b[k,j] for k in range(N)]

import numpy as np
A = np.matrix([[1,1],[5,2]])
B = np.matrix([[3,4],[1,2]])
i = 1
j = 0
Y = A[i,:] + B[j,:]
res = np.min(Y, axis=1)
ind = np.argmin(Y, axis=1)

for i in range(N):
    for j in range(N):
        B[i,j] = 0 if A[i,j] == 1 else i

N = A.shape[0]
B = np.arange(N).repeat(N).reshape(N, N)
B[A == 1] = 0