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 12:47Victor MerckléVictor MerckléScore: 26,414Success
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 12:4826,375137,650,513128,214,0001,024,0002,117,632stderr
2Sep 2, 2026 12:4826,412137,869,846128,323,0001,097,0002,117,632stderr
3Sep 2, 2026 12:4826,414137,845,235128,345,0001,088,0002,117,632stderr
4Sep 2, 2026 12:4826,414138,179,761128,340,0001,091,0002,117,632stderr
5Sep 2, 2026 12:4826,414139,019,563128,328,0001,104,0002,117,632stderr
6Sep 2, 2026 12:4826,415137,870,816128,348,0001,087,0002,117,632stderr
7Sep 2, 2026 12:4826,418139,026,271128,353,0001,096,0002,117,632stderr
8Sep 2, 2026 12:4826,422137,908,208128,369,0001,100,0002,117,632stderr
9Sep 2, 2026 12:4826,449138,725,131128,355,0001,247,0002,117,632stderr