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 9, 2026 23:12Victor MerckléVictor MerckléScore: 29,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 23:1229,543153,302,275143,756,0001,009,0002,117,632stderr
2Jul 9, 2026 23:1229,560152,751,056143,835,0001,009,0002,117,632stderr
3Jul 9, 2026 23:1229,599153,121,540143,013,0002,025,0002,117,632stderr
4Jul 9, 2026 23:1229,608153,176,508144,074,0001,010,0002,117,632stderr
5Jul 9, 2026 23:1229,680153,504,026143,396,0002,038,0002,117,632stderr
6Jul 9, 2026 23:1229,718153,471,032143,583,0002,038,0002,117,632stderr
7Jul 9, 2026 23:1229,741153,869,407143,684,0002,050,0002,117,632stderr
8Jul 9, 2026 23:1229,779153,997,822144,912,0001,009,0002,117,632stderr
9Jul 9, 2026 23:1229,909154,685,186145,547,0001,009,0002,117,632stderr