in reply to Risque Romantic Rosetta Roman Race

Trying to optimize for speed gets weird :) 

{
my %r2d;
@r2d{qw(
  i ii iii iv v vi vii viii ix
  x xx xxx xl l lx lxx lxxx xc
  c cc ccc cd d dc dcc dccc cm
  m mm mmm
  )} = map { my $n = $_; map $n * $_, 1 .. 9 } 1, 10, 100, 1000;
use List::Util qw( sum );
sub roman_to_dec3
  {
  sum @r2d{ (lc shift) =~ /
    ix|iv|iii|ii|i|
    viii|vii|vi|v|
    xxx|xx|xl|xc|x|
    lxxx|lxx|lx|l|
    cm|cd|ccc|cc|c|
    dccc|dcc|dc|d|
    mmm|mm|m|
    ./gx }
  }
}

[download]

Tests faster than your 'reduce' version on my machine...

Replies are listed 'Best First'.
Re^2: Risque Romantic Rosetta Roman Race - MCE Hash Regex
by marioroy (Prior) on May 13, 2023 at 13:13 UTC

    The regex variant tested slightly slower on my machine, compared to the array-unpack-reduce demonstration.

    Read more... (3 kB)

    Running with one worker.

    # max_workers => 1
time reduce : 4.581 secs
time regex  : 4.658 secs

    [download]
[reply]
[d/l]
[select]

      On my machine, I find the qr// version runs slightly slower than the non-qr// version.

      Also I get the regex version about 18% faster than the reduce version.

[reply]
        Also I get the regex version about 18% faster than the reduce version.

        Same here. There is ~ 20% faster between hash-reduce and hash-regex. I was referring to the array-reduce variant. It is quite fast (for me at least on two machines). To factor out the AMD machine, I tried the three MCE variants on an Intel machine. The CPU has 8 physical cores and 8 logical cores. There was a typo in the array-unpack-reduce example on PM; fixed.

        Update: Added Array ForLoop results.

        # C++ without fast_io
# https://www.perlmonks.org/?node_id=11152156
$ ./rtoa-pgatram-fixed t1.txt >f.tmp
read_input_files  : 3999000 items
read file time    :    0.213 secs
roman_to_dec time :    0.120 secs
output time       :    0.809 secs
total time        :    1.142 secs

# MCE Hash Reduce
# https://www.perlmonks.org/?node_id=11152073
# $output .= reduce { $a+$b-$a%$b*2 } @rtoa{ split //, uc($_) };
$ perl rtoa-mce-hash-reduce.pl t1.txt >m.tmp
rtoa pgatram start
time 1.245 secs

# MCE Hash Regex
# https://www.perlmonks.org/?node_id=11152160
# $output .= sum @r2d{ (lc $_) =~ /$re/go };
$ perl rtoa-mce-hash-regex.pl t1.txt >m.tmp
rtoa pgatram start
time 0.952 secs

# MCE Array Reduce
# https://www.perlmonks.org/?node_id=11152119
# $output .= reduce { $a+$b-$a%$b*2 } @rtoa[ unpack 'c*', uc($_) ];
$ perl rtoa-mce-array-reduce.pl t1.txt >m.tmp
rtoa pgatram start
time 0.657 secs

# MCE Array ForLoop
# https://www.perlmonks.org/?node_id=11152168
$ perl rtoa-mce-array-forloop.pl t1.txt >m.tmp
rtoa pgatram start
time 0.533 secs

        [download]

        I'm unable to build fast_io as the compiler on the mac lacks -std=c++20 support. I need to update the toolchain.

        Apple clang version 11.0.3 (clang-1103.0.32.62)
error: invalid value 'c++20' in '-std=c++20'

        [download]

        From this session, it does not require a big box for Perl consuming many CPU cores to reach C++.

[reply]
[d/l]
[select]

In Section Meditations