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 23, 2026 16:55Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 16:5501,919,931,9501,907,403,0001,130,00020,480Exit with code 3: n=250000000 min=11 max=4294967278 mean=2147540765 even=0.5000 sorted=0.5000 eq=0 len: 1:0.00000 2:0.00000 3:0.00000 4:0.00000 5:0.00002 6:0.00021 7:0.00209 8:0.02096 9:0.20954 10:0.76718 top4: 0.063 0.062 0.062 0.062 0.062 0.063 0.062...stderr