I often use the rough approximation that Python is 40-50x slower than C. This is what you&#x27;ll see in the benchmarks.The truly rough thing about Python though is that that is the speed when the code is being written to a benchmark. It is really, really easy to write Python that is multiples slower than that when not writing to a benchmark and just trying to get work done without hyperoptimizing. I did some testing of Python [1] to back some other commentary I was making that compared the time it took to set an attribute repeatedly on a particular instance of an empty class to the time it took to setting it on a subclass of a subclass of a class that had a property setter that was wrapped by a decorator. The latter was about 4.6 time slower than the direct attribute setting, which was itself already ~100x slower than an attribute setting in a static language.And it&#x27;s not like a three-deep nested class with a property wrapped by a decorator is all that absurd in Python or anything. That&#x27;s a completely normal case, not some absurd example I made up to skew the test.In practice the 40-50x number is more lower bound than what you can count on. If you are actually using Python&#x27;s features I think you can easily score another order of magnitude slower without anything jumping out at you as being an obviously bad idea.[1]: <a href="https:&#x2F;&#x2F;jerf.org&#x2F;iri&#x2F;post&#x2F;2024&#x2F;not_about_python_addendum&#x2F;" rel="nofollow">https:&#x2F;&#x2F;jerf.org&#x2F;iri&#x2F;post&#x2F;2024&#x2F;not_about_python_addendum&#x2F;</a>

I appreciate that you first tried to optimize the original Python code. Idiomatic Python is unfortunately disappointingly slow and not so interesting to compare to.

it&#x27;s possible! although many of the constraints in this blog were because we wanted to work with ast module in Python. If we were allowed to create our own types, we can do so much better. I think ruff has an even faster walk by those standards.It seems bandit is using some decent optimizations already, looking at the `@test.checks(&quot;Call&quot;)` seems like they already captured some easy wins.The largest win honestly would be using the same ast.walk for multiple rules, which we also did, but not mentioned in the blog.

AST: Abstract Syntax TreeFST: Full Syntax TreeCST: Concrete Syntax TreeComment preservation is a feature

Could this ast.sprint ast.walk optimization make libCST or bandit faster? 
<a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=39111747">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=39111747</a>libCST: <a href="https:&#x2F;&#x2F;github.com&#x2F;Instagram&#x2F;LibCST" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;Instagram&#x2F;LibCST</a>bandit: <a href="https:&#x2F;&#x2F;github.com&#x2F;PyCQA&#x2F;bandit" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;PyCQA&#x2F;bandit</a>Links to codemod tools; &quot;Baby Steps into Genetic Programming&quot; <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=43617655">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=43617655</a>

only because I&#x27;m too lazy to learn how to write C with Python, if anything Rust wasn&#x27;t helpful with all of those unsafes

let me guess, the improved version is written in Rust?

Making ast.walk 220x Faster