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 3, 2026 11:49Victor MerckléVictor MerckléScore: 31,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 11:4931,429162,375,822152,994,0001,009,0002,117,632stderr
2Aug 3, 2026 11:4931,509162,756,562153,388,0001,009,0002,117,632stderr
3Aug 3, 2026 11:4931,538162,950,484153,532,0001,009,0002,117,632stderr
4Aug 3, 2026 11:4931,607163,270,785153,871,0001,008,0002,117,632stderr
5Aug 3, 2026 11:4931,645163,414,686154,051,0001,010,0002,117,632stderr
6Aug 3, 2026 11:4931,708163,838,850154,363,0001,011,0002,117,632stderr
7Aug 3, 2026 11:4931,733163,914,253154,486,0001,010,0002,117,632stderr
8Aug 3, 2026 11:4931,741164,537,021154,524,0001,010,0002,117,632stderr
9Aug 3, 2026 11:4931,972166,765,306155,652,0001,011,0002,117,632stderr