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 5, 2026 18:05Victor MerckléVictor MerckléScore: 46,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 18:0645,962233,180,050223,185,0002,032,0002,117,632stderr
2Jul 5, 2026 18:0645,964233,164,495223,183,0002,043,0002,117,632stderr
3Jul 5, 2026 18:0645,987233,356,517223,299,0002,040,0002,117,632stderr
4Jul 5, 2026 18:0646,006233,458,757224,422,0001,009,0002,117,632stderr
5Jul 5, 2026 18:0646,023233,351,072223,450,0002,065,0002,117,632stderr
6Jul 5, 2026 18:0646,055233,736,196224,665,0001,007,0002,117,632stderr
7Jul 5, 2026 18:0646,055233,483,517223,662,0002,008,0002,117,632stderr
8Jul 5, 2026 18:0646,179234,050,964224,254,0002,025,0002,117,632stderr
9Jul 5, 2026 18:0647,530240,902,554230,852,0002,046,0002,117,632stderr