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 12:10Victor MerckléVictor MerckléScore: 25,694Success
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 12:1625,669134,611,427124,773,0001,008,0002,117,632stderr
2Sep 3, 2026 12:1625,676135,484,593124,788,0001,029,0002,117,632stderr
3Sep 3, 2026 12:1625,688134,424,959124,786,0001,090,0002,117,632stderr
4Sep 3, 2026 12:1625,692134,303,113124,769,0001,126,0002,117,632stderr
5Sep 3, 2026 12:1625,694134,391,923124,768,0001,134,0002,117,632stderr
6Sep 3, 2026 12:1625,697134,343,669124,829,0001,089,0002,117,632stderr
7Sep 3, 2026 12:1625,703134,401,042124,852,0001,093,0002,117,632stderr
8Sep 3, 2026 12:1625,703134,443,642124,849,0001,100,0002,117,632stderr
9Sep 3, 2026 12:1625,704134,463,793124,860,0001,090,0002,117,632stderr