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 listJul 3, 2026 08:00Victor MerckléVictor MerckléScore: 49,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 08:0449,183248,864,049238,975,0002,022,0002,117,632stderr
2Jul 3, 2026 08:0449,192249,025,125239,005,0002,036,0002,117,632stderr
3Jul 3, 2026 08:0449,230249,209,826239,122,0002,106,0002,117,632stderr
4Jul 3, 2026 08:0449,230249,218,765239,133,0002,098,0002,117,632stderr
5Jul 3, 2026 08:0449,255249,239,287239,301,0002,051,0002,117,632stderr
6Jul 3, 2026 08:0449,293249,537,272239,481,0002,057,0002,117,632stderr
7Jul 3, 2026 08:0449,301249,450,956239,561,0002,018,0002,117,632stderr
8Jul 3, 2026 08:0449,307249,533,693239,565,0002,043,0002,117,632stderr
9Jul 3, 2026 08:0449,694251,401,285241,478,0002,027,0002,117,632stderr