Are list comprehensions faster than loops?

loops_vs_comps_speed.py

import datetime

count = 10_000_000


def with_loop():
    lst = []
    for n in range(1, count):
        if n % 2 == 0:
            lst.append(n)

    return lst


def with_comp():
    return [n for n in range(1, count) if n % 2 == 0]


def time(func, name):
    t0 = datetime.datetime.now()
    func()
    t1 = datetime.datetime.now()

    ms = (t1 - t0).total_seconds() * 1000
    print(f"{name} done in {ms:.3f} ms")


with_loop()
with_comp()

time(with_loop, "loop")
time(with_comp, "comp")

Yes, on my mac I get:

loop done in 446.050 ms
comp done in 346.185 ms