It's just a simple regex benchmark for different programming languages.

Measures how long it takes to find and count non-overlapping occurrences with default settings.

All benchmarks are wrong, but some are useful - Szilard, benchm-ml

I hope this benchmark can be helpful, but it's not only about performance, but each language also has its engine and offers different features (like UTF support, backreferences, capturing groups ...)

The input text is a concatenation of Learn X in Y minutes repository.

Maybe isn't the best representative text. I'm searching other texts to add to the benchmark.

• Email: [\w\.+-]+@[\w\.-]+\.[\w\.-]+
• URI: [\w]+://[^/\s?#]+[^\s?#]+(?:\?[^\s#]*)?(?:#[^\s]*)?
• IPv4: (?:(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|[01]?[0-9][0-9])

The above regex patterns aren't the best or the optimal. The focus is the benchmark, not the matching.

The patterns are applied to the whole file.

Measuring is done inside the programs to avoid include startup, reading and writing times on results.

Elapsed time include pattern compilation, find and count occurrences.

Docker image was run on: MacBook Pro (16-inch, 2019), 2.4 GHz Intel Core i9, 32 GB 2667 Mhz DDR4 with macOS Big Sur 11.2.3.

The following results are for the optimized version.

• Language: Indicates the language.
• Email(ms), URI(ms), IP(ms): Indicates the time elapsed in milliseconds for finding and counting non-overlapping occurrences for the pattern.
• Total(ms): Indicates the sum of the above times.

• C: gcc 7.5.0 & PCRE2 10.36-2
• Crystal: crystal 0.35.1 - LLVM: 8.0.0
• C++: g++ 7.5.0 | Boost 1.65.1.0
• C#: dotnet 5.0.201 | Mono 6.12.0.122
• D: DMD v2.089.0 | LDC 1.8.0
• Dart: Dart 2.12.2
• Go: go 1.16.2
• Java: OpenJDK 11.0.10
• Javascript: node v15.13.0
• Julia: Julia 1.6.0
• Kotlin: kotlinc-jvm 1.4.32
• Nim: Nim 1.4.4
• Perl: perl v5.26.1
• PHP: PHP 8.0.3
• Python: Python 2.7.17 | Python 3.6.9 | PyPy 7.3.3
• Ruby: ruby 2.5.1p57
• Rust: rustc 1.51.0 & regex 1.4.5

The easiest way to run the benchmark is by using Docker.

git clone https://github.com/mariomka/regex-benchmark.git
cd regex-benchmark
docker run --rm -v $(pwd):/var/regex mariomka/regex-benchmark:1.6

All contributions are welcome, from tiny optimizations to new implementations.

There are only a few requirements:

• Follow the style of the current implementations
• Use the default settings for the regex engine
• Update Dockerfile if it's necessary

• Heng Li's for his work on Benchmark of Regex Libraries.
• A "challenge" on Madrid Devs group inspired me.
• Programming subreddit, helped me to improve the benchmark.

MIT © Mario Juárez.