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 6, 2026 23:09Victor MerckléVictor MerckléScore: 39,929Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:1334,174175,414,263165,428,0002,027,0002,117,632stderr
2Jul 6, 2026 23:1335,707182,856,870172,907,0002,058,0002,117,632stderr
3Jul 6, 2026 23:1335,788183,304,653174,356,0001,007,0002,117,632stderr
4Jul 6, 2026 23:1339,631202,115,860176,205,00017,991,00024,576stderr
5Jul 6, 2026 23:1339,929203,516,843178,238,00017,417,00024,576stderr
6Jul 6, 2026 23:1340,816207,829,787182,193,00017,808,0002,117,632stderr
7Jul 6, 2026 23:1342,805217,638,232182,893,00026,853,0002,117,632stderr
8Jul 6, 2026 23:1344,372225,274,604186,605,00030,820,00024,576stderr
9Jul 6, 2026 23:1344,502226,019,187186,988,00031,072,00024,576stderr