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 06:11Victor MerckléVictor MerckléScore: 28,315Success
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 06:1228,283146,968,612137,578,0001,009,0002,117,632stderr
2Aug 25, 2026 06:1228,296147,098,872137,645,0001,009,0002,117,632stderr
3Aug 25, 2026 06:1228,306147,114,804136,695,0002,009,0002,117,632stderr
4Aug 25, 2026 06:1228,311147,178,688137,718,0001,010,0002,117,632stderr
5Aug 25, 2026 06:1228,315147,206,432136,730,0002,015,0002,117,632stderr
6Aug 25, 2026 06:1228,329147,244,874136,807,0002,009,0002,117,632stderr
7Aug 25, 2026 06:1228,335147,430,432136,823,0002,020,0002,117,632stderr
8Aug 25, 2026 06:1228,337147,260,587136,810,0002,043,0002,117,632stderr
9Aug 25, 2026 06:1228,350147,462,340136,869,0002,050,0002,117,632stderr