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:40Victor MerckléVictor MerckléScore: 47,275Success
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:4147,178239,216,254229,170,0002,005,0002,117,632stderr
2Jul 3, 2026 23:4147,215239,315,591229,353,0002,005,0002,117,632stderr
3Jul 3, 2026 23:4147,223239,384,830229,344,0002,050,0002,117,632stderr
4Jul 3, 2026 23:4147,254239,772,787229,439,0002,109,0002,117,632stderr
5Jul 3, 2026 23:4147,275239,560,613229,571,0002,078,0002,117,632stderr
6Jul 3, 2026 23:4147,287239,628,089229,661,0002,046,0002,117,632stderr
7Jul 3, 2026 23:4147,335239,918,677229,901,0002,042,0002,117,632stderr
8Jul 3, 2026 23:4147,534240,906,462230,883,0002,037,0002,117,632stderr
9Jul 3, 2026 23:4150,456255,179,433245,224,0002,012,0002,117,632stderr