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 23:31Victor MerckléVictor MerckléScore: 62,711Success
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 23:3262,589315,191,196304,505,0002,184,0002,117,632stderr
2Aug 24, 2026 23:3262,624315,368,875304,689,0002,171,0002,117,632stderr
3Aug 24, 2026 23:3262,669315,504,214304,903,0002,177,0002,117,632stderr
4Aug 24, 2026 23:3262,670315,487,358305,081,0002,006,0002,117,632stderr
5Aug 24, 2026 23:3262,711315,687,988305,138,0002,147,0002,117,632stderr
6Aug 24, 2026 23:3262,780316,059,964305,453,0002,170,0002,117,632stderr
7Aug 24, 2026 23:3262,780316,027,928305,579,0002,044,0002,117,632stderr
8Aug 24, 2026 23:3262,794316,157,288305,685,0002,008,0002,117,632stderr
9Aug 24, 2026 23:3262,850316,416,903305,951,0002,015,0002,117,632stderr