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 01:04Victor MerckléVictor MerckléScore: 32,510Success
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 01:0532,273167,208,849157,128,0001,011,0002,117,632stderr
2Aug 25, 2026 01:0532,289166,674,798157,208,0001,011,0002,117,632stderr
3Aug 25, 2026 01:0532,387167,126,024157,688,0001,010,0002,117,632stderr
4Aug 25, 2026 01:0532,454168,117,310158,016,0001,011,0002,117,632stderr
5Aug 25, 2026 01:0532,510167,700,083158,292,0001,010,0002,117,632stderr
6Aug 25, 2026 01:0532,777170,240,274159,601,0001,009,0002,117,632stderr
7Aug 25, 2026 01:0532,819169,212,671159,808,0001,008,0002,117,632stderr
8Aug 25, 2026 01:0533,071170,452,936161,040,0001,012,0002,117,632stderr
9Aug 25, 2026 01:0533,276171,443,122162,044,0001,012,0002,117,632stderr