Re^2: Python regex faster than Perl?

Interestingly, no. I modified the code in the following way:

my $count = 0;
$count += () = /mul\(\d{1,3},\d{1,3}\)/g while <$fh>;
[download]

Slurping took 0.582s, line-by-line processing takes 0.680s.

map{substr$_->[0],$_->[1]||0,1}[\*||{},3],[[]],[ref qr-1,-,-1],[{}],[sub{}^*ARGV,3]

Comment on Re^2: Python regex faster than Perl? Select or Download Code