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 22:35Victor MerckléVictor MerckléScore: 32,194Success
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 22:3531,840164,427,773155,006,0001,010,0002,117,632stderr
2Aug 24, 2026 22:3531,971165,096,660155,648,0001,011,0002,117,632stderr
3Aug 24, 2026 22:3532,113165,732,172156,349,0001,009,0002,117,632stderr
4Aug 24, 2026 22:3532,156165,998,578156,560,0001,009,0002,117,632stderr
5Aug 24, 2026 22:3532,194166,205,605156,741,0001,012,0002,117,632stderr
6Aug 24, 2026 22:3532,318166,788,207157,354,0001,007,0002,117,632stderr
7Aug 24, 2026 22:3532,655168,430,550159,002,0001,010,0002,117,632stderr
8Aug 24, 2026 22:3532,825169,190,074159,835,0001,009,0002,117,632stderr
9Aug 24, 2026 22:3533,012170,143,555160,750,0001,012,0002,117,632stderr