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 04:32Victor MerckléVictor MerckléScore: 28,273Success
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 04:3328,094146,001,526136,654,0001,011,0002,117,632stderr
2Aug 25, 2026 04:3328,110146,139,628135,721,0002,022,0002,117,632stderr
3Aug 25, 2026 04:3328,216147,792,488136,253,0002,007,0002,117,632stderr
4Aug 25, 2026 04:3328,245147,250,618137,394,0001,011,0002,117,632stderr
5Aug 25, 2026 04:3328,273146,986,633137,529,0001,011,0002,117,632stderr
6Aug 25, 2026 04:3328,277146,936,411136,542,0002,020,0002,117,632stderr
7Aug 25, 2026 04:3328,354147,380,781136,890,0002,049,0002,117,632stderr
8Aug 25, 2026 04:3328,406147,524,302138,182,0001,010,0002,117,632stderr
9Aug 25, 2026 04:3328,453147,807,916138,412,0001,010,0002,117,632stderr