Find the largest palindrome made from the product of two 3-digit numbers [euler,perl]

004.pl

#!/usr/bin/env perl

=pod

Find the largest palindrome made from the product of two 3-digit numbers.

=cut

use strict;
use warnings FATAL => 'all';

my @numbers = reverse 100 .. 999;
my $answer  = eval {
    my ( $max, $val ) = ( 0, '' );
    while ( my $a = shift @numbers ) {
        for my $b (@numbers) {
            my $c = $a * $b;
            if ( ( $max < $c ) && ( $c == reverse $c ) ) {
                ( $max, $val ) = ( $c, "{ $a * $b = $c }" );
            }
        }
    }
    return $val;
};

print "$answer\n";