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 15:43Victor MerckléVictor MerckléScore: 27,506Success
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 15:4427,346142,397,901132,965,0001,032,0002,117,632stderr
2Aug 25, 2026 15:4427,355142,493,120132,974,0001,068,0002,117,632stderr
3Aug 25, 2026 15:4427,458143,080,145133,448,0001,097,0002,117,632stderr
4Aug 25, 2026 15:4427,486143,195,160133,593,0001,090,0002,117,632stderr
5Aug 25, 2026 15:4427,506143,218,414133,658,0001,124,0002,117,632stderr
6Aug 25, 2026 15:4427,507144,309,089133,636,0001,151,0002,117,632stderr
7Aug 25, 2026 15:4427,536143,490,192133,842,0001,088,0002,117,632stderr
8Aug 25, 2026 15:4427,551143,422,710133,906,0001,096,0002,117,632stderr
9Aug 25, 2026 15:4427,641153,381,090134,262,0001,182,0002,117,632stderr