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 3, 2026 23:20Victor MerckléVictor MerckléScore: 47,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 23:2147,708243,405,277231,645,0002,128,0002,117,632stderr
2Jul 3, 2026 23:2147,714241,717,998231,770,0002,032,0002,117,632stderr
3Jul 3, 2026 23:2147,721241,822,658232,829,0001,006,0002,117,632stderr
4Jul 3, 2026 23:2147,749242,098,190231,924,0002,048,0002,117,632stderr
5Jul 3, 2026 23:2147,772242,020,490232,073,0002,010,0002,117,632stderr
6Jul 3, 2026 23:2147,777242,138,075232,068,0002,042,0002,117,632stderr
7Jul 3, 2026 23:2147,877242,554,984232,568,0002,034,0002,117,632stderr
8Jul 3, 2026 23:2148,185243,878,081234,066,0002,041,0002,117,632stderr
9Jul 3, 2026 23:2148,212244,181,065234,237,0002,005,0002,117,632stderr