It is worth noting that the implementations for those benchmarks are contributed by a community, not all written by the same person (IIRC), so if someone is interested in using a language to the best of its hypothetical performance ceiling, they can definitely submit a solution.<p>I&#x27;m not sure about the details for the &quot;fasta&quot; benchmark, but I know it&#x27;s at least partly I&#x2F;O bound, and many implementations for the benchmark are single-threaded:<p><a href="https:&#x2F;&#x2F;benchmarksgame.alioth.debian.org&#x2F;u64q&#x2F;performance.php?test=fasta" rel="nofollow">https:&#x2F;&#x2F;benchmarksgame.alioth.debian.org&#x2F;u64q&#x2F;performance.ph...</a><p>Notably, Rust also edges out a multi-threaded C implementation for that one. I&#x27;m sure they&#x27;ve done some very hairy optimizations to get to the top on that board, but it&#x27;s cool to see that it&#x27;s possible.<p>On the subject of regexes, I am not familiar with the C++ std::regex implementation, but it does look like (some rather slow) C++ implementations are using a boost regex library. Those are generally fairly &quot;standard&quot; in C++, right?