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 4, 2026 00:02Victor MerckléVictor MerckléScore: 26,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 00:0326,627138,941,059129,431,0001,045,0002,117,632stderr
2Sep 4, 2026 00:0326,628138,966,138129,459,0001,019,0002,117,632stderr
3Sep 4, 2026 00:0326,638138,950,751129,515,0001,016,0002,117,632stderr
4Sep 4, 2026 00:0326,666139,209,576129,572,0001,094,0002,117,632stderr
5Sep 4, 2026 00:0326,669139,176,056129,578,0001,101,0002,117,632stderr
6Sep 4, 2026 00:0326,671139,182,987129,594,0001,096,0002,117,632stderr
7Sep 4, 2026 00:0326,674139,159,532129,597,0001,106,0002,117,632stderr
8Sep 4, 2026 00:0326,679139,204,468129,625,0001,103,0002,117,632stderr
9Sep 4, 2026 00:0326,688139,313,960129,687,0001,087,0002,117,632stderr