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: 65,322Success
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:1964,764327,372,276309,403,0007,945,00020,480
2Jul 27, 2026 15:1964,845327,859,125309,018,0008,726,00020,480
3Jul 27, 2026 15:1964,986328,592,037308,941,0009,492,0002,113,536
4Jul 27, 2026 15:1965,204330,238,633308,922,00010,579,0002,113,536
5Jul 27, 2026 15:1965,322330,131,221308,871,00011,210,0002,113,536
6Jul 27, 2026 15:1965,377330,483,651308,932,00011,417,0002,113,536
7Jul 27, 2026 15:1965,382331,032,720310,147,00010,229,00020,480
8Jul 27, 2026 15:1965,392330,445,585308,800,00011,624,0002,113,536
9Jul 27, 2026 15:1965,432330,992,724308,975,00011,645,0002,113,536