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 23:05Victor MerckléVictor MerckléScore: 26,470Success
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 23:0626,422137,957,154128,448,0001,022,0002,117,632stderr
2Sep 3, 2026 23:0626,442138,048,126128,520,0001,048,0002,117,632stderr
3Sep 3, 2026 23:0626,454138,057,882128,598,0001,030,0002,117,632stderr
4Sep 3, 2026 23:0626,458138,106,621128,598,0001,047,0002,117,632stderr
5Sep 3, 2026 23:0626,470138,149,164128,619,0001,088,0002,117,632stderr
6Sep 3, 2026 23:0626,485138,235,443128,660,0001,119,0002,117,632stderr
7Sep 3, 2026 23:0626,487138,266,577128,697,0001,094,0002,117,632stderr
8Sep 3, 2026 23:0626,493138,272,111128,721,0001,099,0002,117,632stderr
9Sep 3, 2026 23:0626,510139,672,711128,800,0001,099,0002,117,632stderr