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 14:29Kevin HeaveyKevin HeaveyScore: 68,498Success
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 15:0868,138343,950,730325,204,0008,676,00020,480
2Jul 27, 2026 15:0868,154344,050,434325,071,0008,887,0002,113,536
3Jul 27, 2026 15:0868,154354,727,256325,421,0008,537,00020,480
4Jul 27, 2026 15:0868,364345,867,958325,161,0009,827,00020,480
5Jul 27, 2026 15:0868,498346,280,735324,955,00010,690,00020,480
6Jul 27, 2026 15:0868,510346,471,354324,990,00010,712,00020,480
7Jul 27, 2026 15:0868,559346,295,942325,815,00010,128,0002,113,536
8Jul 27, 2026 15:0868,695356,600,617325,213,00011,396,00020,480
9Jul 27, 2026 15:0869,621351,361,567328,791,00012,355,00020,480