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 listMay 11, 2026 17:50Victor MerckléVictor MerckléScore: 68,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 17:5167,974341,877,880330,818,0002,257,0002,113,536
2May 11, 2026 17:5168,024343,949,312331,245,0002,074,0002,113,536
3May 11, 2026 17:5168,037344,299,368331,252,0002,132,0002,113,536
4May 11, 2026 17:5168,074344,270,760331,443,0002,120,0002,113,536
5May 11, 2026 17:5168,083342,518,491331,549,0002,060,0002,113,536
6May 11, 2026 17:5168,097343,890,109331,557,0002,122,0002,113,536
7May 11, 2026 17:5168,201345,557,057332,098,0002,088,0002,113,536
8May 11, 2026 17:5168,584346,754,808333,985,0002,077,0002,113,536
9May 11, 2026 17:5169,630350,234,286338,973,0002,214,0002,113,536