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 25, 2026 15:59Victor MerckléVictor MerckléScore: 30,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 15:5930,191156,281,090146,916,0001,021,0002,117,632stderr
2Aug 25, 2026 15:5930,202156,416,637146,957,0001,035,0002,117,632stderr
3Aug 25, 2026 15:5930,219156,466,397147,054,0001,020,0002,117,632stderr
4Aug 25, 2026 15:5930,227156,482,706147,098,0001,016,0002,117,632stderr
5Aug 25, 2026 15:5930,259157,231,616147,176,0001,096,0002,117,632stderr
6Aug 25, 2026 15:5930,270156,680,436147,236,0001,090,0002,117,632stderr
7Aug 25, 2026 15:5930,274156,730,574147,255,0001,092,0002,117,632stderr
8Aug 25, 2026 15:5930,277156,704,112147,272,0001,086,0002,117,632stderr
9Aug 25, 2026 15:5930,547158,080,412148,587,0001,098,0002,117,632stderr