You might want to use the bin number as the key of the hash and add the count to it whenever you encounter it. It could look like this:

use strict;
use warnings;

my %hash;
my $data = "BIN COUNT 1 20 2 0 2 1 3 0 3 0 3 1 7 0 8 2 9 1 9 2 10 3";
$hash{$1} += $2 while $data =~ /(\d+) (\d+)/g;
print "BIN COUNT ";
print "$_ $hash{$_} " for sort {$a<=>$b} keys %hash;
[download]

Also, please use code tags in your post to make it more readible.

G'day eric_newbie,

Welcome to the monastery.

$hash{$seq++} = { BIN => $bin_num, COUNT => $count, }; creates a complex hash of hashes structure. I don't believe this is what you want; it's probably the reason you were unable to progresas your code beyond this point.

I would've started by storing the file data in a simple array; then used a simple hash for the merge.

#!/usr/bin/env perl -l

use strict;
use warnings;

my @init = qw{1 20 2 0 2 1 3 0 3 0 3 1 7 0 8 2 9 1 9 2 10 3};
print "@init";

my %merge;
$merge{$init[$_]} += $init[$_+1] for grep { not $_ % 2 } 0 .. $#init; 

my @out = map { $_, $merge{$_} } sort { $a <=> $b } keys %merge;
print "@out";
[download]

Output:

1 20 2 0 2 1 3 0 3 0 3 1 7 0 8 2 9 1 9 2 10 3
1 20 2 1 3 1 7 0 8 2 9 3 10 3
[download]

[For future reference, please see the guidelines in "How do I post a question effectively?".]

please

Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":
[download]

see also:

What purpose does $hash{$seq++}= ... serve? Please explain this in your own words.

Maybe you can think about how a hash basically maps a "name" (for example, a bin) to a value (for example, the current count).