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 24, 2026 18:18Victor MerckléVictor MerckléScore: 46,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:1946,174234,607,528225,251,0001,006,0002,117,632stderr
2Aug 24, 2026 18:1946,375236,301,853226,234,0001,005,0002,117,632stderr
3Aug 24, 2026 18:1946,647237,382,677227,569,0001,005,0002,117,632stderr
4Aug 24, 2026 18:1946,652241,073,542226,585,0002,014,0002,117,632stderr
5Aug 24, 2026 18:1946,986243,223,075228,227,0002,006,0002,117,632stderr
6Aug 24, 2026 18:1947,094240,332,638229,755,0001,008,0002,117,632stderr
7Aug 24, 2026 18:1947,210240,067,218228,252,0003,077,0002,117,632stderr
8Aug 24, 2026 18:1947,571245,909,124228,062,0005,038,0002,117,632stderr
9Aug 24, 2026 18:1949,037249,309,679239,279,0001,006,0002,117,632stderr