Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listAug 25, 2026 05:21Victor MerckléVictor MerckléScore: 27,986Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 05:2227,822144,695,306134,283,0002,046,0002,117,632stderr
2Aug 25, 2026 05:2227,825144,728,030135,337,0001,010,0002,117,632stderr
3Aug 25, 2026 05:2227,976145,558,091135,030,0002,056,0002,117,632stderr
4Aug 25, 2026 05:2227,986145,567,235135,084,0002,050,0002,117,632stderr
5Aug 25, 2026 05:2227,986145,526,130136,123,0001,010,0002,117,632stderr
6Aug 25, 2026 05:2228,022145,769,867136,301,0001,010,0002,117,632stderr
7Aug 25, 2026 05:2228,088146,031,537135,618,0002,018,0002,117,632stderr
8Aug 25, 2026 05:2228,163146,452,768135,926,0002,073,0002,117,632stderr
9Aug 25, 2026 05:2228,185146,545,108136,095,0002,015,0002,117,632stderr