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:17Victor MerckléVictor MerckléScore: 29,788Success
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:1729,688153,298,440143,458,0002,018,0002,117,632stderr
2Jul 9, 2026 23:1729,711153,724,433144,576,0001,009,0002,117,632stderr
3Jul 9, 2026 23:1729,738153,622,396144,707,0001,010,0002,117,632stderr
4Jul 9, 2026 23:1729,782154,066,563143,901,0002,035,0002,117,632stderr
5Jul 9, 2026 23:1729,788154,048,195144,955,0001,009,0002,117,632stderr
6Jul 9, 2026 23:1729,810153,990,059144,060,0002,009,0002,117,632stderr
7Jul 9, 2026 23:1729,888154,531,035145,445,0001,010,0002,117,632stderr
8Jul 9, 2026 23:1730,045155,157,548146,215,0001,010,0002,117,632stderr
9Jul 9, 2026 23:1730,398156,809,031147,941,0001,010,0002,117,632stderr