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 17:49Victor MerckléVictor MerckléScore: 30,385Success
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 17:5030,218156,469,669146,038,0002,035,0002,117,632stderr
2Aug 24, 2026 17:5030,244156,615,480147,185,0001,011,0002,117,632stderr
3Aug 24, 2026 17:5030,352157,067,134147,716,0001,010,0002,117,632stderr
4Aug 24, 2026 17:5030,358157,154,303147,750,0001,009,0002,117,632stderr
5Aug 24, 2026 17:5030,385157,259,168146,873,0002,015,0002,117,632stderr
6Aug 24, 2026 17:5030,411157,157,683148,007,0001,008,0002,117,632stderr
7Aug 24, 2026 17:5030,420157,485,327148,052,0001,009,0002,117,632stderr
8Aug 24, 2026 17:5030,485157,788,990148,368,0001,009,0002,117,632stderr
9Aug 24, 2026 17:5030,510157,843,616148,491,0001,009,0002,117,632stderr