Perl - Rosettacode Prime_conspiracy task

Prime_conspiracy.pl

use ntheory qw/forprimes nth_prime/;

my $upto = 100_000_000;
my @freq;
my($this_digit,$last_digit)=(2,0);

forprimes {
  ($last_digit,$this_digit) = ($this_digit, $_ % 10);
  $freq[$last_digit . $this_digit]++;
} 3,nth_prime($upto);

print "$upto first primes.  Transitions prime % 10 → next-prime % 10.\n";
for my $i (0..$#freq) {
    next unless $freq[$i];
    printf "%s → %s count:\t%7d\tfrequency: %4.2f %%\n",
      substr($i,0,1), substr($i,1,1), $freq[$i], 100*$freq[$i]/$upto
}

Would you recommend replacing the code on RC or adding it as an alternative?

TIL... Yup, it all works as advertised. And I'm always in favor of keeping it simple, and putting just the best version on RC, so a vote to 'replace'.