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 8, 2026 10:40Victor MerckléVictor MerckléScore: 31,739Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 10:4031,482162,328,749153,254,0001,009,0002,117,632stderr
2Jul 8, 2026 10:4031,520162,322,732153,438,0001,011,0002,117,632stderr
3Jul 8, 2026 10:4031,547162,456,744153,575,0001,010,0002,117,632stderr
4Jul 8, 2026 10:4031,596162,747,397152,817,0002,007,0002,117,632stderr
5Jul 8, 2026 10:4031,739163,568,427154,515,0001,009,0002,117,632stderr
6Jul 8, 2026 10:4031,844163,964,612155,025,0001,013,0002,117,632stderr
7Jul 8, 2026 10:4031,949164,696,898155,540,0001,013,0002,117,632stderr
8Jul 8, 2026 10:4032,129165,511,187156,423,0001,011,0002,117,632stderr
9Jul 8, 2026 10:4032,148165,402,901156,518,0001,010,0002,117,632stderr