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 24, 2026 10:59Dominique GarmierDominique GarmierScore: 195,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 03:16195,503991,622,326955,968,0001,999,0002,478,080
2Mar 24, 2026 10:59195,563989,242,060957,262,000999,0002,490,368
3Mar 24, 2026 03:16195,576987,703,581955,327,0002,997,0002,490,368
4Mar 24, 2026 10:59195,609987,293,126956,485,0001,998,0002,347,008
5Mar 24, 2026 03:16195,616990,455,236956,521,0001,999,0002,334,720
6Mar 24, 2026 10:59196,240990,051,140959,578,0001,999,0002,482,176