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 3, 2026 12:29Victor MerckléVictor MerckléScore: 26,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:3326,546139,783,284129,016,0001,061,0002,117,632stderr
2Sep 3, 2026 12:3326,559138,824,233129,049,0001,091,0002,117,632stderr
3Sep 3, 2026 12:3326,568138,664,301129,098,0001,087,0002,117,632stderr
4Sep 3, 2026 12:3326,569138,753,825129,095,0001,096,0002,117,632stderr
5Sep 3, 2026 12:3326,572139,118,435129,112,0001,093,0002,117,632stderr
6Sep 3, 2026 12:3326,576138,721,344129,124,0001,103,0002,117,632stderr
7Sep 3, 2026 12:3326,577138,618,213129,135,0001,094,0002,117,632stderr
8Sep 3, 2026 12:3326,579138,714,566129,143,0001,098,0002,117,632stderr
9Sep 3, 2026 12:3326,582138,719,063129,099,0001,156,0002,117,632stderr