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 listSep 3, 2026 22:49Victor MerckléVictor MerckléScore: 25,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:5025,280132,797,802122,690,0001,185,0002,117,632stderr
2Sep 3, 2026 22:5025,282132,355,254122,765,0001,117,0002,117,632stderr
3Sep 3, 2026 22:5025,288132,407,019122,820,0001,093,0002,117,632stderr
4Sep 3, 2026 22:5025,290132,397,642122,830,0001,091,0002,117,632stderr
5Sep 3, 2026 22:5025,293132,484,383122,768,0001,170,0002,117,632stderr
6Sep 3, 2026 22:5025,304132,581,509122,887,0001,105,0002,117,632stderr
7Sep 3, 2026 22:5025,304133,261,914122,895,0001,099,0002,117,632stderr
8Sep 3, 2026 22:5025,306133,144,679122,889,0001,112,0002,117,632stderr
9Sep 3, 2026 22:5025,319132,473,598123,052,0001,013,0002,117,632stderr