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 00:14Victor MerckléVictor MerckléScore: 31,227Success
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 00:1531,048160,517,691151,126,0001,012,0002,117,632stderr
2Aug 25, 2026 00:1531,070160,656,318150,218,0002,025,0002,117,632stderr
3Aug 25, 2026 00:1531,089160,726,181150,307,0002,030,0002,117,632stderr
4Aug 25, 2026 00:1531,115160,882,234150,457,0002,011,0002,117,632stderr
5Aug 25, 2026 00:1531,227161,417,901152,005,0001,009,0002,117,632stderr
6Aug 25, 2026 00:1531,234161,454,317151,023,0002,025,0002,117,632stderr
7Aug 25, 2026 00:1531,250161,569,166151,109,0002,020,0002,117,632stderr
8Aug 25, 2026 00:1531,260161,586,406151,167,0002,011,0002,117,632stderr
9Aug 25, 2026 00:1531,420162,403,680151,952,0002,006,0002,117,632stderr