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:23Victor MerckléVictor MerckléScore: 25,294Success
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:2425,262132,266,878122,686,0001,100,0002,117,632stderr
2Sep 3, 2026 22:2425,271132,315,891122,702,0001,128,0002,117,632stderr
3Sep 3, 2026 22:2425,271132,318,903122,784,0001,046,0002,117,632stderr
4Sep 3, 2026 22:2425,285132,354,950122,798,0001,103,0002,117,632stderr
5Sep 3, 2026 22:2425,294132,405,598122,854,0001,089,0002,117,632stderr
6Sep 3, 2026 22:2425,295132,421,102122,817,0001,129,0002,117,632stderr
7Sep 3, 2026 22:2425,301132,446,256122,879,0001,097,0002,117,632stderr
8Sep 3, 2026 22:2425,305132,545,713122,893,0001,105,0002,117,632stderr
9Sep 3, 2026 22:2425,318132,506,934122,841,0001,221,0002,117,632stderr