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 25, 2026 00:06Victor MerckléVictor MerckléScore: 28,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 00:0727,922145,182,082134,813,0002,007,0002,117,632stderr
2Aug 25, 2026 00:0727,981145,730,778135,065,0002,044,0002,117,632stderr
3Aug 25, 2026 00:0728,013145,625,762135,231,0002,033,0002,117,632stderr
4Aug 25, 2026 00:0728,113146,127,958136,746,0001,010,0002,117,632stderr
5Aug 25, 2026 00:0728,125146,183,559136,803,0001,011,0002,117,632stderr
6Aug 25, 2026 00:0728,154146,337,984135,935,0002,022,0002,117,632stderr
7Aug 25, 2026 00:0728,160146,356,638135,942,0002,045,0002,117,632stderr
8Aug 25, 2026 00:0728,164146,384,027136,998,0001,009,0002,117,632stderr
9Aug 25, 2026 00:0728,181146,475,738137,080,0001,010,0002,117,632stderr