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 03:26Victor MerckléVictor MerckléScore: 26,096Success
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 03:2826,086136,208,543126,791,0001,034,0002,117,632stderr
2Sep 2, 2026 03:2826,091136,237,515126,759,0001,091,0002,117,632stderr
3Sep 2, 2026 03:2826,093136,664,036126,774,0001,086,0002,117,632stderr
4Sep 2, 2026 03:2826,096136,270,106126,779,0001,095,0002,117,632stderr
5Sep 2, 2026 03:2826,096136,956,140126,780,0001,094,0002,117,632stderr
6Sep 2, 2026 03:2826,097136,723,013126,750,0001,128,0002,117,632stderr
7Sep 2, 2026 03:2826,097136,347,616126,780,0001,099,0002,117,632stderr
8Sep 2, 2026 03:2826,104136,999,084126,804,0001,108,0002,117,632stderr
9Sep 2, 2026 03:2826,118136,968,237126,873,0001,109,0002,117,632stderr