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 11:24Victor MerckléVictor MerckléScore: 104,918Success
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 11:25104,237521,838,879508,619,0002,144,0002,113,536
2May 11, 2026 11:25104,526521,332,889509,936,0002,246,0002,113,536
3May 11, 2026 11:25104,738524,945,028510,982,0002,238,0002,113,536
4May 11, 2026 11:25104,904522,798,841511,803,0002,230,0002,113,536
5May 11, 2026 11:25104,918524,401,690511,921,0002,182,0002,113,536
6May 11, 2026 11:25104,956525,959,441512,222,0002,064,0002,113,536
7May 11, 2026 11:25105,468526,062,807514,559,0002,237,0002,113,536
8May 11, 2026 11:25105,864530,397,066516,479,0002,257,0002,113,536
9May 11, 2026 11:25105,996528,206,199517,212,0002,173,0002,113,536