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:33Victor MerckléVictor MerckléScore: 29,403Success
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 18:3429,025153,352,727140,210,0002,014,0002,117,632stderr
2Aug 24, 2026 18:3429,069151,687,642141,432,0001,009,0002,117,632stderr
3Aug 24, 2026 18:3429,337154,727,331140,711,0003,045,0002,117,632stderr
4Aug 24, 2026 18:3429,365155,719,251140,728,0003,165,0002,117,632stderr
5Aug 24, 2026 18:3429,403157,513,083141,978,0002,097,0002,117,632stderr
6Aug 24, 2026 18:3429,469155,846,675141,365,0003,035,0002,117,632stderr
7Aug 24, 2026 18:3429,511156,549,245142,558,0002,046,0002,117,632stderr
8Aug 24, 2026 18:3429,511156,780,424143,598,0001,010,0002,117,632stderr
9Aug 24, 2026 18:3429,522155,516,501142,655,0002,006,0002,117,632stderr