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 12:03Victor MerckléVictor MerckléScore: 49,212Success
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 12:0449,176250,022,597239,858,0001,106,0002,117,632stderr
2Aug 25, 2026 12:0449,181249,401,550239,891,0001,098,0002,117,632stderr
3Aug 25, 2026 12:0449,196249,300,886239,971,0001,092,0002,117,632stderr
4Aug 25, 2026 12:0449,209249,529,550240,024,0001,102,0002,117,632stderr
5Aug 25, 2026 12:0449,212250,264,821240,038,0001,102,0002,117,632stderr
6Aug 25, 2026 12:0449,218250,203,718240,142,0001,031,0002,117,632stderr
7Aug 25, 2026 12:0449,223249,514,651240,095,0001,102,0002,117,632stderr
8Aug 25, 2026 12:0449,230249,410,071240,118,0001,111,0002,117,632stderr
9Aug 25, 2026 12:0449,240249,663,961240,159,0001,120,0002,117,632stderr