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:13Victor MerckléVictor MerckléScore: 27,826Success
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:1427,786144,565,526135,143,0001,011,0002,117,632stderr
2Aug 25, 2026 06:1427,795144,650,944134,182,0002,018,0002,117,632stderr
3Aug 25, 2026 06:1427,795145,210,783135,185,0001,011,0002,117,632stderr
4Aug 25, 2026 06:1427,816144,654,036135,289,0001,011,0002,117,632stderr
5Aug 25, 2026 06:1427,826144,848,157134,337,0002,012,0002,117,632stderr
6Aug 25, 2026 06:1427,826144,725,768134,332,0002,020,0002,117,632stderr
7Aug 25, 2026 06:1427,842146,099,955134,422,0002,007,0002,117,632stderr
8Aug 25, 2026 06:1427,849144,919,436134,404,0002,060,0002,117,632stderr
9Aug 25, 2026 06:1427,855145,821,883134,481,0002,009,0002,117,632stderr