Figuring out a checksum algorithm

I've got a checksum of some kind here, some files and some checksums.

[167, 9, 4, 0, 165, 216, 39, 0] => 882
[107, 136, 2, 0, 227, 205, 39, 0] => 828

The checksum is about two magnitudes larger than the input data, so some kind of addition is likely used.  Just adding the bytes together does not work, neither does xoring the bytes with a fixed value and then adding them.

I don't think I have the means to try out whether a checksum is correct or not, and I can't generate checksums for arbritary data either.  Any ideas, some kind of common algorithm for this perhaps?

>>22
There's probably more tools for analyzing PE modules than there's tools for analyzing ELF. You could start with IDA(commercial, but has linux build), while debugging it in OllyDBG(in WINE) to get it done quickly.