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 09:38Victor MerckléVictor MerckléScore: 28,365Success
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 09:3928,344149,341,839137,862,0001,024,0002,117,632stderr
2Sep 2, 2026 09:3928,359147,427,033137,874,0001,089,0002,117,632stderr
3Sep 2, 2026 09:3928,361147,464,290137,873,0001,098,0002,117,632stderr
4Sep 2, 2026 09:3928,363147,484,321137,852,0001,128,0002,117,632stderr
5Sep 2, 2026 09:3928,365147,409,136137,906,0001,086,0002,117,632stderr
6Sep 2, 2026 09:3928,366147,497,212137,876,0001,120,0002,117,632stderr
7Sep 2, 2026 09:3928,367147,472,568137,899,0001,104,0002,117,632stderr
8Sep 2, 2026 09:3928,372148,099,499137,927,0001,098,0002,117,632stderr
9Sep 2, 2026 09:3928,376148,132,831137,908,0001,138,0002,117,632stderr