project-euler/Trashed attempts/111 Primes with runs.pl

#!/usr/bin/perl

# Daniel "Trizen" Șuteu
# License: GPLv3
# Date: 09 February 2017
# Website: https://github.com/trizen

# https://projecteuler.net/problem=111

# Runtime: 31.57 min

# For a faster approach, see version 2.

use 5.010;
use strict;
use warnings;

use ntheory qw(forprimes vecsum todigits);

my @max;
my @sums;

my $p;
my @table;

forprimes {
    $p = $_;

    $#table = -1;
    ++$table[$_] for todigits($p);

    foreach my $i (0..$#table) {

        my $count = $table[$i] // next;

        if (defined $max[$i]) {
            if ($count > $max[$i]) {
                $max[$i] = $count;
                $sums[$i] = $p;
            }
            elsif ($count == $max[$i]) {
                $sums[$i] += $p;
            }
        }
        else {
            $max[$i] = $count;
            $sums[$i] = $p;
        }
    }

} 1000000000, 9999999999;

say vecsum(grep { defined($_) } @sums);