In [1]:

    

import timeit


    

In [2]:

    

def test(n):
    return sum(range(n))


    

In [3]:

    

n = 10000
loop = 1000


    

In [4]:

    

result = timeit.timeit('test(n)', globals=globals(), number=loop)
print(result / loop)


    

    




0.0002666301020071842

In [5]:

    

result = timeit.timeit(lambda: test(n), number=loop)
print(result / loop)


    

    




0.00027574066299712287

In [6]:

    

print(timeit.timeit(lambda: test(n), number=1))
print(timeit.timeit(lambda: test(n), number=10))
print(timeit.timeit(lambda: test(n), number=100))


    

    




0.0003999490290880203
0.0038685189792886376
0.03517670702422038

In [7]:

    

repeat = 5
print(timeit.repeat(lambda: test(n), repeat=repeat, number=100))


    

    




[0.044914519996382296, 0.039663890027441084, 0.02868645201670006, 0.022745631984435022, 0.023260265996214002]

In [8]:

    

# magic command
# It works only on Jupyter / IPython.


    

In [9]:

    

%timeit test(n)


    

    




259 µs ± 4.87 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)

In [10]:

    

%timeit -r 3 -n 10000 test(n)


    

    




237 µs ± 6.44 µs per loop (mean ± std. dev. of 3 runs, 10000 loops each)

In [11]:

    

%%timeit -r 3 -n 10000
import numpy as np
a = np.arange(n)
np.sum(a)


    

    




19.7 µs ± 9.57 µs per loop (mean ± std. dev. of 3 runs, 10000 loops each)