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 listJul 27, 2026 11:59Kevin HeaveyKevin HeaveyScore: 66,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:0765,204329,585,809309,443,00010,057,0002,113,536
2Jul 27, 2026 12:0765,653331,710,343309,821,00011,883,0002,113,536
3Jul 27, 2026 12:0765,694331,905,222310,002,00011,901,00020,480
4Jul 27, 2026 12:0765,813332,551,964309,952,00012,534,0002,113,536
5Jul 27, 2026 12:0766,120334,082,579310,189,00013,803,0002,113,536
6Jul 27, 2026 12:0766,219334,516,031314,532,0009,944,00020,480
7Jul 27, 2026 12:0766,280334,765,654310,704,00014,071,0002,113,536
8Jul 27, 2026 12:0766,625336,497,220310,535,00015,931,0002,113,536
9Jul 27, 2026 12:0767,833342,445,828320,742,00011,640,00020,480