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 22:39Victor MerckléVictor MerckléScore: 25,961Success
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 22:4025,921135,453,576125,909,0001,108,0002,117,632stderr
2Sep 3, 2026 22:4025,937135,541,658125,994,0001,102,0002,117,632stderr
3Sep 3, 2026 22:4025,951135,649,373126,069,0001,094,0002,117,632stderr
4Sep 3, 2026 22:4025,959135,639,488126,102,0001,101,0002,117,632stderr
5Sep 3, 2026 22:4025,961135,655,578126,112,0001,098,0002,117,632stderr
6Sep 3, 2026 22:4025,962135,656,669126,120,0001,098,0002,117,632stderr
7Sep 3, 2026 22:4025,963135,778,528126,116,0001,106,0002,117,632stderr
8Sep 3, 2026 22:4025,964135,712,257126,135,0001,093,0002,117,632stderr
9Sep 3, 2026 22:4025,973135,686,497126,036,0001,236,0002,117,632stderr