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 2, 2026 04:22Victor MerckléVictor MerckléScore: 26,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 04:2326,317137,343,322127,864,0001,093,0002,117,632stderr
2Sep 2, 2026 04:2326,319137,403,229127,849,0001,115,0002,117,632stderr
3Sep 2, 2026 04:2326,320137,434,363127,864,0001,107,0002,117,632stderr
4Sep 2, 2026 04:2326,320137,379,307127,862,0001,106,0002,117,632stderr
5Sep 2, 2026 04:2326,326137,253,822127,885,0001,117,0002,117,632stderr
6Sep 2, 2026 04:2326,332137,460,111127,936,0001,092,0002,117,632stderr
7Sep 2, 2026 04:2326,332137,451,673127,933,0001,094,0002,117,632stderr
8Sep 2, 2026 04:2326,338137,555,064127,912,0001,148,0002,117,632stderr
9Sep 2, 2026 04:2326,356137,615,091127,883,0001,262,0002,117,632stderr