That value is going to be hidden away in the underlying C or C++ installation by which your Perl was compiled at Perl-installation time. It isn't going to be easy to break into. It would be easier to say globally replace srand with a call to a wrapper function capsrand that captures it on calling before passing it to the real srand. e.g.:

package CapSrand;

sub new {
    bless { LOG => [], LEN => 10 };
}

sub capsrand {
    my $self = shift;
-*    $self -> { PARM } = shift;
    $self -> capture;
    srand( $self -> { PARM } );
}

sub capture {
    # note: LIFO queue
    my $self = shift;
    unshift @{ $self -> { LOG } }, $self -> { PARM };
    $#{ $self -> { LOG } } >= $self -> { LEN }
      and $#{ $self -> { LOG } } = $self -> { LEN } - 1;
}

sub latest {
    my $self = shift;
    $self -> { LOG }[ 0 ] or undef();
}

1;
[download]

Update: to address the question of improving randomness by priming the seed, the usual way is to extract the most random behaving digits out of a time representation (usually near but not at the end of the sequence).

For example if the time representation (e.g. in fractions of years since epoch) is 31.57065428547826, then the temptation is to take the last few digits for a seed, whereas these are more likely to repeat than say the 8th thru 11th digits of the 14 after the "." owing to the rounding enforced by the O/S to say 1/1000 of a second, which screws the randomness of just the last three digits.