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 listJul 27, 2026 12:06Kevin HeaveyKevin HeaveyScore: 61,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:1761,247309,943,206289,833,00010,279,00020,480
2Jul 27, 2026 12:1761,454311,065,751290,197,00010,932,00020,480
3Jul 27, 2026 12:1761,547311,461,609289,699,00011,882,00020,480
4Jul 27, 2026 12:1761,653311,956,632289,849,00012,251,00020,480
5Jul 27, 2026 12:1761,689312,124,260290,306,00011,972,00020,480
6Jul 27, 2026 12:1761,699312,088,124290,669,00011,658,00020,480
7Jul 27, 2026 12:1761,705312,225,054290,521,00011,835,0002,113,536
8Jul 27, 2026 12:1761,717312,233,625290,164,00012,254,00020,480
9Jul 27, 2026 12:1761,734312,392,007290,713,00011,784,0002,113,536