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 11, 2026 17:05olliecrowolliecrowScore: 93,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2026 17:0593,711481,010,268458,186,0001,000,0002,535,424
2Mar 11, 2026 17:0593,721485,804,186458,233,0001,000,0002,375,680
3Mar 11, 2026 17:0593,727480,230,899458,260,0001,000,0002,379,776
4Mar 11, 2026 17:0593,730482,403,654457,279,0001,996,0002,371,584
5Mar 11, 2026 17:0593,733482,667,396458,294,0001,000,0002,383,872
6Mar 11, 2026 17:0593,734482,035,873458,296,0001,000,0002,277,376
7Mar 11, 2026 17:0593,734488,906,672459,296,00002,277,376
8Mar 11, 2026 17:0593,736486,013,710458,304,0001,000,0002,375,680
9Mar 11, 2026 17:0593,756486,612,661458,407,000998,0002,277,376