in reply to using hash uniqueness to find the odd man

I have a potentially super-fast mechanism. Hash slices:
my %seen; @seen{@larger_list} = (); delete @seen{@smaller_list}; my @culprits = keys %culprit;
However, if you have the data in files to begin with, it's probably best NOT to put them in arrays.

japhy -- Perl and Regex Hacker