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 listSep 2, 2026 01:28Victor MerckléVictor MerckléScore: 29,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:2929,670153,774,306144,367,0001,016,0002,117,632stderr
2Sep 2, 2026 01:2929,670153,767,850144,347,0001,037,0002,117,632stderr
3Sep 2, 2026 01:2929,733154,071,977144,581,0001,111,0002,117,632stderr
4Sep 2, 2026 01:2929,734154,059,748144,673,0001,024,0002,117,632stderr
5Sep 2, 2026 01:2929,736154,224,389144,610,0001,097,0002,117,632stderr
6Sep 2, 2026 01:2929,739154,198,276144,627,0001,098,0002,117,632stderr
7Sep 2, 2026 01:2929,740154,222,192144,636,0001,092,0002,117,632stderr
8Sep 2, 2026 01:2929,770154,334,213144,777,0001,100,0002,117,632stderr
9Sep 2, 2026 01:2930,006155,482,746145,929,0001,105,0002,117,632stderr