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 listApr 28, 2026 08:44Victor MerckléVictor MerckléError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 08:45022,975,29202,190,000290,816Exit with code 1: mt625_v=1 stat=1 regular=1 size=1000000000 n=625 p=d8f090d0,aaf8f04f,cb50dccf,2b13461f,1c6b8299,261502ad,162e5dab,677e874c,2de5c34f,b0f03ddb,e5450968,ef27f4b4,292022b1,041f39aa,5bb7bf3a,ce0a501c,68f86b2e,9ee1dbc4,7abe3375,68eb79fc,43e...stderr