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 listSep 2, 2026 10:46Victor MerckléVictor MerckléScore: 26,110Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 11:0026,095137,713,361126,847,0001,023,0002,117,632stderr
2Sep 2, 2026 11:0026,096136,338,336126,849,0001,022,0002,117,632stderr
3Sep 2, 2026 11:0026,100136,312,396126,791,0001,100,0002,117,632stderr
4Sep 2, 2026 11:0026,106136,350,343126,819,0001,102,0002,117,632stderr
5Sep 2, 2026 11:0026,110136,468,838126,822,0001,117,0002,117,632stderr
6Sep 2, 2026 11:0026,117136,348,255126,882,0001,092,0002,117,632stderr
7Sep 2, 2026 11:0026,122136,411,162126,898,0001,103,0002,117,632stderr
8Sep 2, 2026 11:0026,122136,424,237126,910,0001,090,0002,117,632stderr
9Sep 2, 2026 11:0026,191136,835,429127,242,0001,097,0002,117,632stderr