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 12:54Kevin HeaveyKevin HeaveyScore: 53,903Success
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:1453,493272,189,266252,681,0009,437,00020,480
2Jul 27, 2026 13:1453,603273,488,849252,929,0009,728,00020,480
3Jul 27, 2026 13:1453,677273,085,598252,785,00010,237,00020,480
4Jul 27, 2026 13:1453,901274,110,285252,672,00011,445,00020,480
5Jul 27, 2026 13:1453,903274,839,210252,778,00011,347,00020,480
6Jul 27, 2026 13:1453,908274,891,851252,928,00011,226,00020,480
7Jul 27, 2026 13:1454,034274,784,193252,990,00011,781,00020,480
8Jul 27, 2026 13:1454,188275,866,087252,721,00012,804,00020,480
9Jul 27, 2026 13:1456,223286,187,095263,533,00011,963,00020,480