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:30Kevin HeaveyKevin HeaveyScore: 59,236Success
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 13:4058,857298,374,076278,523,0009,881,00020,480
2Jul 27, 2026 13:4058,933298,651,959278,640,00010,135,00020,480
3Jul 27, 2026 13:4058,950303,946,317278,568,00010,288,00020,480
4Jul 27, 2026 13:4059,234300,147,395279,142,00011,109,00020,480
5Jul 27, 2026 13:4059,236300,119,277278,195,00012,065,00020,480
6Jul 27, 2026 13:4059,367300,889,332279,058,00011,842,00020,480
7Jul 27, 2026 13:4059,752313,712,917280,212,00012,574,00020,480
8Jul 27, 2026 13:4060,158304,626,928282,951,00011,827,00020,480
9Jul 27, 2026 13:4060,462306,137,938285,043,00011,222,00020,480