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:25Kevin HeaveyKevin HeaveyScore: 64,031Success
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:0463,562321,543,568302,720,0008,735,00020,480
2Jul 27, 2026 15:0463,611322,434,020302,883,0008,815,0002,113,536
3Jul 27, 2026 15:0463,666322,117,290302,964,0009,003,0002,113,536
4Jul 27, 2026 15:0463,920323,580,106304,035,0009,177,00020,480
5Jul 27, 2026 15:0464,031323,825,594303,073,00010,683,0002,113,536
6Jul 27, 2026 15:0464,044323,842,082302,589,00011,231,00020,480
7Jul 27, 2026 15:0464,252324,880,670302,545,00012,292,00020,480
8Jul 27, 2026 15:0464,355325,425,415304,313,00011,031,0002,113,536
9Jul 27, 2026 15:0464,524326,187,903304,936,00011,233,0002,113,536