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 20:18Pavel SkripkinPavel SkripkinScore: 2,886,382Success
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 20:182,869,67314,094,183,13913,930,458,000130,938,0002,277,376
2Mar 13, 2026 20:182,871,55614,100,787,46013,937,683,000132,939,0002,277,376
3Mar 13, 2026 20:182,874,57414,126,015,94113,952,487,000132,928,0002,277,376
4Mar 13, 2026 20:182,875,23214,118,450,14713,953,710,000134,929,0002,285,568
5Mar 13, 2026 20:182,886,38214,175,337,02814,016,331,000126,939,0002,277,376
6Mar 13, 2026 20:182,911,06514,297,235,79014,125,293,000138,924,0002,277,376
7Mar 13, 2026 20:182,956,81514,516,686,95714,370,446,000117,946,0002,277,376
8Mar 13, 2026 20:182,961,26414,543,814,92214,379,263,000130,929,0002,277,376
9Mar 13, 2026 20:183,023,93714,845,648,32314,705,340,000111,949,0002,260,992