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:32Victor MerckléVictor MerckléScore: 29,326Success
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:3228,969150,327,241139,942,0002,009,0002,117,632stderr
2Aug 3, 2026 11:3229,017150,697,070140,141,0002,047,0002,117,632stderr
3Aug 3, 2026 11:3229,175151,419,708140,908,0002,053,0002,117,632stderr
4Aug 3, 2026 11:3229,236151,422,195141,206,0002,053,0002,117,632stderr
5Aug 3, 2026 11:3229,326152,806,865141,670,0002,031,0002,117,632stderr
6Aug 3, 2026 11:3229,361152,266,182141,799,0002,070,0002,117,632stderr
7Aug 3, 2026 11:3229,412153,067,699143,109,0001,010,0002,117,632stderr
8Aug 3, 2026 11:3229,571153,306,316143,889,0001,009,0002,117,632stderr
9Aug 3, 2026 11:3229,696153,912,569143,503,0002,009,0002,117,632stderr