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 26, 2026 22:41Jasper EdbrookeJasper EdbrookeScore: 233,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 22:41231,9321,163,296,888989,536,000146,931,0002,289,664
2Mar 26, 2026 22:41231,9981,158,734,332995,815,000140,973,0002,281,472
3Mar 26, 2026 22:41232,1561,162,112,0161,044,598,00092,964,0002,281,472
4Mar 26, 2026 22:41232,1881,160,760,7711,033,746,000103,974,0002,498,560
5Mar 26, 2026 22:41233,9621,169,554,1711,008,484,000137,929,0002,494,464
6Mar 26, 2026 22:41234,2151,171,975,4121,027,690,000119,963,0002,338,816
7Mar 26, 2026 22:41234,3371,174,042,6801,036,324,000111,927,0002,281,472
8Mar 26, 2026 22:41234,3961,177,833,4221,012,593,000135,945,0002,490,368
9Mar 26, 2026 22:41236,6501,185,838,4281,080,616,00078,971,0002,281,472