in reply to Multiplication digit persistence

When searching for the 12 stepper, you probably need to modify the script in the following way:
- my $p = product split //, $n; + my $p = 'Math::BigInt'->new(product split //, $n);
Also, put
use Math::BigInt;
somewhere to the top, and enclose the to-be-winner in quotes.

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

Replies are listed 'Best First'.
Re^2: Multiplication digit persistence
by tobyink (Canon) on Mar 22, 2019 at 10:20 UTC

    Tbh, I doubt that's enough. product is written in C. You'd probably want to replace it with a Math::BigInt version.