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:35Kevin HeaveyKevin HeaveyScore: 65,712Success
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:2365,237330,385,684311,622,0008,040,00020,480
2Jul 27, 2026 15:2365,328330,536,663311,696,0008,414,0002,113,536
3Jul 27, 2026 15:2365,343330,980,296311,605,0008,579,00020,480
4Jul 27, 2026 15:2365,701332,080,419312,336,0009,603,00020,480
5Jul 27, 2026 15:2365,712332,183,835311,637,00010,352,00020,480
6Jul 27, 2026 15:2365,747332,242,540311,740,00010,422,0002,113,536
7Jul 27, 2026 15:2365,801332,466,573312,448,0009,978,0002,113,536
8Jul 27, 2026 15:2365,853332,788,866312,612,00010,071,00020,480
9Jul 27, 2026 15:2366,118333,998,580311,667,00012,314,00020,480