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 listMar 14, 2026 11:48Dominique GarmierDominique GarmierScore: 172,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 09:36169,091856,633,080827,547,000999,0002,265,088
2Mar 20, 2026 09:36170,307864,200,120832,505,0001,998,0002,273,280
3Mar 20, 2026 09:36170,986865,628,040835,830,0001,999,0002,273,280
4Mar 14, 2026 11:48172,314871,538,671836,344,0007,993,000176,128
5Mar 14, 2026 11:48172,432875,293,849835,918,0008,999,000200,704
6Mar 14, 2026 11:48172,479871,643,568836,159,0008,990,000204,800