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 13, 2026 12:25Dominique GarmierDominique GarmierScore: 192,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 12:25189,112953,492,473924,652,0001,999,0002,273,280
2Mar 13, 2026 12:25189,912956,676,308928,570,0001,999,0002,273,280
3Mar 13, 2026 12:25191,081967,198,312936,299,00002,273,280
4Mar 13, 2026 12:25191,767970,267,967937,661,0001,999,0002,473,984
5Mar 13, 2026 12:25192,148973,394,215940,526,000999,0002,273,280
6Mar 13, 2026 12:25192,995970,337,365944,675,000999,0002,322,432
7Mar 13, 2026 12:25194,959984,573,415953,300,0001,998,0002,473,984
8Mar 13, 2026 12:25196,919992,174,637964,901,00002,273,280
9Mar 13, 2026 12:25198,672996,530,865971,497,0001,998,0002,527,232