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 18:01Victor MerckléVictor MerckléScore: 30,215Success
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 18:0230,019155,431,912146,088,0001,009,0002,117,632stderr
2Aug 24, 2026 18:0230,065157,052,307146,310,0001,011,0002,117,632stderr
3Aug 24, 2026 18:0230,073155,827,766145,329,0002,033,0002,117,632stderr
4Aug 24, 2026 18:0230,202157,088,841146,984,0001,009,0002,117,632stderr
5Aug 24, 2026 18:0230,215156,463,901146,040,0002,016,0002,117,632stderr
6Aug 24, 2026 18:0230,235159,125,671147,147,0001,009,0002,117,632stderr
7Aug 24, 2026 18:0230,242156,570,100147,178,0001,010,0002,117,632stderr
8Aug 24, 2026 18:0230,244157,314,135147,190,0001,010,0002,117,632stderr
9Aug 24, 2026 18:0230,262156,678,581146,182,0002,104,0002,117,632stderr