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:18Victor MerckléVictor MerckléScore: 69,040Success
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:1968,899347,677,614335,408,0002,198,0002,113,536
2May 11, 2026 17:1968,954349,003,378335,736,0002,142,0002,113,536
3May 11, 2026 17:1969,014348,579,937336,017,0002,155,0002,113,536
4May 11, 2026 17:1969,035350,457,567336,169,0002,107,0002,113,536
5May 11, 2026 17:1969,040347,254,580336,281,0002,016,0002,113,536
6May 11, 2026 17:1969,063347,189,303336,354,0002,057,0002,113,536
7May 11, 2026 17:1969,887353,349,628340,409,0002,039,0002,113,536
8May 11, 2026 17:1970,422354,756,477343,021,0002,048,0002,113,536
9May 11, 2026 17:1970,780356,035,344344,795,0002,029,0002,113,536