This reminded me of an ancient thread (Re: Interesting Perl/Java regexp benchmarking), and sure enough, Perl is faster in the negative case e.g.

% hyperfine --warmup 3 'perl re.pl sample.txt' 'python3 re.py sample.t
+xt'
Benchmark 1: perl re.pl sample.txt
  Time (mean ± σ):     232.9 ms ±   2.2 ms    [User: 132.1 ms, Sy
+stem: 99.5 ms]
  Range (min … max):   230.8 ms … 238.4 ms    12 runs
 
Benchmark 2: python3 re.py sample.txt
  Time (mean ± σ):     373.3 ms ±   5.6 ms    [User: 246.1 ms, Sy
+stem: 125.4 ms]
  Range (min … max):   365.5 ms … 383.7 ms    10 runs
 
Summary
  perl re.pl sample.txt ran
    1.60 ± 0.03 times faster than python3 re.py sample.txt
[download]

All I changed was the separator for the number pair in the regex to ";" i.e.

mul\(\d{1,3};\d{1,3}\)
[download]

I used choroba's method to generate the sample (but with 10_000_000 lines).