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 00:27Victor MerckléVictor MerckléScore: 48,020Success
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 00:2847,618241,086,273231,277,0002,054,0002,117,632stderr
2Jul 4, 2026 00:2847,655241,435,615231,480,0002,033,0002,117,632stderr
3Jul 4, 2026 00:2847,668241,570,632231,488,0002,088,0002,117,632stderr
4Jul 4, 2026 00:2847,688241,626,724231,596,0002,080,0002,117,632stderr
5Jul 4, 2026 00:2848,020243,002,503233,230,0002,072,0002,117,632stderr
6Jul 4, 2026 00:2848,076243,514,900233,490,0002,084,0002,117,632stderr
7Jul 4, 2026 00:2848,203251,304,020234,115,0002,084,0002,117,632stderr
8Jul 4, 2026 00:2848,458245,477,047235,394,0002,051,0002,117,632stderr
9Jul 4, 2026 00:2851,050257,943,502248,102,0002,047,0002,117,632stderr