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:47Kevin HeaveyKevin HeaveyScore: 54,037Success
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:1453,436272,161,098252,248,0009,591,00020,480
2Jul 27, 2026 14:1453,501272,322,659252,705,0009,451,00020,480
3Jul 27, 2026 14:1453,904274,251,396252,260,00011,874,00020,480
4Jul 27, 2026 14:1453,989275,287,677252,481,00012,066,00020,480
5Jul 27, 2026 14:1454,037274,862,949252,883,00011,899,00020,480
6Jul 27, 2026 14:1454,042275,066,438252,459,00012,348,00020,480
7Jul 27, 2026 14:1454,125275,328,730253,261,00011,954,00020,480
8Jul 27, 2026 14:1454,169275,546,860253,147,00012,284,00020,480
9Jul 27, 2026 14:1457,748293,082,845273,107,0009,861,00020,480