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 16:31Victor MerckléVictor MerckléScore: 27,294Success
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 16:3127,269142,099,788132,528,0001,093,0002,117,632stderr
2Aug 25, 2026 16:3127,289142,140,246132,620,0001,098,0002,117,632stderr
3Aug 25, 2026 16:3127,291142,346,891132,636,0001,094,0002,117,632stderr
4Aug 25, 2026 16:3127,293142,229,118132,653,0001,085,0002,117,632stderr
5Aug 25, 2026 16:3127,294142,156,132132,648,0001,095,0002,117,632stderr
6Aug 25, 2026 16:3127,314142,223,538132,742,0001,097,0002,117,632stderr
7Aug 25, 2026 16:3127,324142,352,783132,786,0001,105,0002,117,632stderr
8Aug 25, 2026 16:3127,330142,470,215132,826,0001,095,0002,117,632stderr
9Aug 25, 2026 16:3127,343142,771,639132,866,0001,117,0002,117,632stderr