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 14:12Dominique GarmierDominique GarmierScore: 170,723Success
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 14:12169,483858,039,919829,466,000999,0002,465,792
2Mar 13, 2026 14:12169,715865,304,522829,604,0001,999,0002,273,280
3Mar 13, 2026 14:12169,858861,721,818832,306,00002,457,600
4Mar 13, 2026 14:12170,310861,059,411833,522,000999,0002,273,280
5Mar 13, 2026 14:12170,723864,205,561834,543,0001,998,0002,265,088
6Mar 13, 2026 14:12171,202865,900,308837,890,000998,0002,273,280
7Mar 13, 2026 14:12171,211871,679,684837,936,000999,0002,273,280
8Mar 13, 2026 14:12171,643866,555,716840,050,0001,000,0002,273,280
9Mar 13, 2026 14:12172,068869,835,263841,138,0001,997,0002,273,280