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 4, 2026 07:13Victor MerckléVictor MerckléScore: 47,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 07:1347,190240,482,643229,186,0002,047,0002,117,632stderr
2Jul 4, 2026 07:1347,197239,289,171229,221,0002,045,0002,117,632stderr
3Jul 4, 2026 07:1347,233239,476,848229,412,0002,032,0002,117,632stderr
4Jul 4, 2026 07:1347,255239,845,382229,458,0002,093,0002,117,632stderr
5Jul 4, 2026 07:1347,257239,567,836229,532,0002,030,0002,117,632stderr
6Jul 4, 2026 07:1347,266239,633,197229,377,0002,229,0002,117,632stderr
7Jul 4, 2026 07:1347,306239,804,355229,672,0002,129,0002,117,632stderr
8Jul 4, 2026 07:1347,356240,084,573229,991,0002,056,0002,117,632stderr
9Jul 4, 2026 07:1347,712241,790,560231,786,0002,007,0002,117,632stderr