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:59Victor MerckléVictor MerckléScore: 28,493Success
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 19:0028,425147,681,820137,251,0002,033,0002,117,632stderr
2Aug 24, 2026 19:0028,447147,808,904137,375,0002,017,0002,117,632stderr
3Aug 24, 2026 19:0028,474147,656,193137,463,0002,060,0002,117,632stderr
4Aug 24, 2026 19:0028,484147,992,739137,537,0002,036,0002,117,632stderr
5Aug 24, 2026 19:0028,493148,068,815137,582,0002,036,0002,117,632stderr
6Aug 24, 2026 19:0028,532148,182,635137,785,0002,023,0002,117,632stderr
7Aug 24, 2026 19:0028,538148,182,135137,823,0002,017,0002,117,632stderr
8Aug 24, 2026 19:0028,548148,327,216137,882,0002,007,0002,117,632stderr
9Aug 24, 2026 19:0028,574148,379,939137,989,0002,025,0002,117,632stderr