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 13:49Kevin HeaveyKevin HeaveyScore: 53,245Success
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 14:1652,727269,014,680247,746,00010,621,00020,480
2Jul 27, 2026 14:1652,840269,091,774248,033,00010,887,0002,113,536
3Jul 27, 2026 14:1652,890269,925,568247,799,00011,366,00020,480
4Jul 27, 2026 14:1653,133270,484,999247,770,00012,582,00020,480
5Jul 27, 2026 14:1653,245271,015,887247,856,00013,045,00020,480
6Jul 27, 2026 14:1653,258271,124,176247,808,00013,160,00020,480
7Jul 27, 2026 14:1653,319271,409,272247,779,00013,486,0002,113,536
8Jul 27, 2026 14:1653,327271,464,691248,324,00012,983,00020,480
9Jul 27, 2026 14:1653,700273,267,267248,004,00015,130,00020,480