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 18:05Victor MerckléVictor MerckléScore: 25,772Success
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 18:0625,714134,454,205124,974,0001,025,0002,117,632stderr
2Sep 3, 2026 18:0625,729134,478,449125,052,0001,023,0002,117,632stderr
3Sep 3, 2026 18:0625,750134,678,094125,094,0001,085,0002,117,632stderr
4Sep 3, 2026 18:0625,763134,654,750125,132,0001,108,0002,117,632stderr
5Sep 3, 2026 18:0625,772134,729,172125,182,0001,101,0002,117,632stderr
6Sep 3, 2026 18:0625,772134,761,292125,182,0001,102,0002,117,632stderr
7Sep 3, 2026 18:0625,774135,355,859125,185,0001,109,0002,117,632stderr
8Sep 3, 2026 18:0625,799134,819,150125,177,0001,239,0002,117,632stderr
9Sep 3, 2026 18:0625,808134,877,124125,456,0001,005,0002,117,632stderr