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:56Victor MerckléVictor MerckléScore: 25,949Success
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:5825,908135,655,040125,939,0001,015,0002,117,632stderr
2Sep 2, 2026 12:5825,929135,437,433126,037,0001,018,0002,117,632stderr
3Sep 2, 2026 12:5825,930135,471,762125,962,0001,096,0002,117,632stderr
4Sep 2, 2026 12:5825,936135,457,799126,001,0001,087,0002,117,632stderr
5Sep 2, 2026 12:5825,949135,609,683126,057,0001,095,0002,117,632stderr
6Sep 2, 2026 12:5825,955136,770,026126,087,0001,095,0002,117,632stderr
7Sep 2, 2026 12:5825,961135,912,498126,105,0001,105,0002,117,632stderr
8Sep 2, 2026 12:5825,964136,000,694126,046,0001,181,0002,117,632stderr
9Sep 2, 2026 12:5825,969135,640,071126,070,0001,180,0002,117,632stderr