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 listAug 25, 2026 04:34Victor MerckléVictor MerckléScore: 28,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 04:3427,823144,859,005135,326,0001,010,0002,117,632stderr
2Aug 25, 2026 04:3427,893145,059,830134,660,0002,016,0002,117,632stderr
3Aug 25, 2026 04:3427,920145,167,676134,776,0002,036,0002,117,632stderr
4Aug 25, 2026 04:3427,980145,468,066135,061,0002,042,0002,117,632stderr
5Aug 25, 2026 04:3428,030146,897,170135,341,0002,008,0002,117,632stderr
6Aug 25, 2026 04:3428,048145,875,470135,389,0002,048,0002,117,632stderr
7Aug 25, 2026 04:3428,049145,893,321135,417,0002,024,0002,117,632stderr
8Aug 25, 2026 04:3428,094146,059,484135,653,0002,010,0002,117,632stderr
9Aug 25, 2026 04:3428,106146,108,462136,709,0001,011,0002,117,632stderr