In my opinion, the level of detail in this article is much more useful than small benchmarks of code that doesn't resemble real applications anyways.

There's already The Benchmarks Game and ixy-languages if you want hard numbers.

Maximum speeds are already explored. I wanted to discuss an aspect that's not typically covered by pure benchmarks: what can you expect from normal day-to-day use of these languages. Not fine-tuned hot loops, but a "median" you can expect when you just need to get shit done.

If I tried to write a benchmark code to represent average, practical, idiomatic, but less-than-maximally optimized code, I don't think anyone would believe me that's a fair comparison. So I describe problems and patterns instead, and leave it to readers to judge how much applies to their problems and programming style.

Benchmarks wouldn't tell the whole story. This detailed writeup is far better in that it gives information about how and where the two languages differ.

Here's my completely unbiased benchmark which use different data structure, uses outside library in one language and non recursive implementation. I hope you don't need the link.