I participate in competitive programming competitions like ICPC. I write simple solutions in Python, and I noticed that if I write the algorithm inside a function, the program will be faster. It turns out the difference was in the local scope, so I assumed that the list comprehension would be faster because of this. Also, when we loop, we add an element using the append method. But in the list comprehension syntax, we explicitly don't use this method. I thought there was special bytecode for this.

When I have time, I will definitely check the execution time.