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 listAug 24, 2026 17:29Victor MerckléVictor MerckléScore: 29,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 17:3029,461152,759,023143,348,0001,012,0002,117,632stderr
2Aug 24, 2026 17:3029,528153,073,214143,680,0001,009,0002,117,632stderr
3Aug 24, 2026 17:3029,534153,161,547143,711,0001,009,0002,117,632stderr
4Aug 24, 2026 17:3029,554153,667,445143,806,0001,009,0002,117,632stderr
5Aug 24, 2026 17:3029,556153,233,030143,819,0001,010,0002,117,632stderr
6Aug 24, 2026 17:3029,591153,216,224143,991,0001,009,0002,117,632stderr
7Aug 24, 2026 17:3029,673153,859,600143,359,0002,039,0002,117,632stderr
8Aug 24, 2026 17:3029,772154,313,651144,875,0001,009,0002,117,632stderr
9Aug 24, 2026 17:3029,933154,800,204144,671,0002,005,0002,117,632stderr