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?

>>17
Which one is it?
RCE can refer to

    * Redcar East railway station, England; National Rail station code RCE.
    * Recursive competitive equilibrium, an economic equilibrium concept associated with a dynamic program
    * Region Code Enhanced, see DVD region code
    * Request for continued examination, in United States patent law, see continuing patent application
    * Response Center Engineer, a cross between a Help Desk and a Call Center