Comparing while and for Loop Performance in Python and Faster Alternatives

Python's interpreted nature makes loops relatively slow, especially when a simple operation is repeated millions of times.

The following benchmark code uses timeit to compare a while loop and a for loop that both sum the numbers from 0 to n (default 100,000,000):

import timeit def while_loop(n=100_000_000): i = 0 s = 0 while i < n: s += i i += 1 return s def for_loop(n=100_000_000): s = 0 for i in range(n): s += i return s def main(): print('while loop', timeit.timeit(while_loop, number=1)) print('for loop', timeit.timeit(for_loop, number=1)) if __name__ == '__main__': main()

Running the test shows the for loop finishes about 1.5 seconds faster than the while loop, because the while version performs an explicit boundary check ( while i &lt; n ) and an explicit increment ( i += 1 ) on each iteration, both written in pure Python.

When the same extra boundary check and increment are deliberately added to a for loop, its performance degrades to be comparable to the while version, confirming that these extra Python‑level operations are the main cause of the slowdown.

Using Python's built‑in sum function to compute the same total eliminates the explicit loop entirely, yielding a dramatic speedup (approximately 0.86 seconds for the same n ), because sum is implemented in C.

Even faster is applying the arithmetic series formula (n * (n - 1)) // 2 , which completes in microseconds (around 2.4e‑6 seconds), effectively removing the need for any iteration.

The overall conclusion is that, for Python, minimizing pure‑Python loop code—preferably by using built‑in functions or mathematical shortcuts—provides the greatest performance gains.