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:34Kevin HeaveyKevin HeaveyScore: 66,069Success
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:2165,448330,974,956313,378,0007,318,0002,113,536
2Jul 27, 2026 15:2165,599331,566,248313,907,0007,531,0002,113,536
3Jul 27, 2026 15:2165,630331,692,872314,057,0007,534,00020,480
4Jul 27, 2026 15:2165,788333,119,300313,817,0008,545,00020,480
5Jul 27, 2026 15:2166,069333,842,663314,096,0009,645,00020,480
6Jul 27, 2026 15:2166,070334,209,011313,791,0009,952,00020,480
7Jul 27, 2026 15:2166,138334,183,761314,013,00010,064,00020,480
8Jul 27, 2026 15:2166,202338,667,634314,299,00010,095,00020,480
9Jul 27, 2026 15:2166,334335,176,675316,824,0008,214,00020,480