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 27, 2026 00:34Jasper EdbrookeJasper EdbrookeScore: 126,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 00:34126,663646,635,900495,718,000124,929,0002,289,664
2Mar 27, 2026 00:34126,720643,648,962495,944,000124,986,0002,510,848
3Mar 27, 2026 00:34126,731643,859,539473,987,000146,996,0002,289,664
4Mar 27, 2026 00:34126,756645,198,260490,083,000131,022,0002,289,664
5Mar 27, 2026 00:34126,907641,372,056489,878,000131,967,0002,519,040
6Mar 27, 2026 00:34126,912647,765,434480,898,000140,970,0002,510,848
7Mar 27, 2026 00:34126,982649,025,484494,167,000128,043,0002,289,664
8Mar 27, 2026 00:34127,743649,042,199479,955,000145,986,0002,510,848
9Mar 27, 2026 00:34127,861651,831,001486,626,000139,892,0002,351,104