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 3, 2026 17:26Victor MerckléVictor MerckléScore: 25,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 17:2725,956135,665,121126,172,0001,013,0002,117,632stderr
2Sep 3, 2026 17:2725,960135,619,705126,183,0001,025,0002,117,632stderr
3Sep 3, 2026 17:2725,962136,088,378126,185,0001,033,0002,117,632stderr
4Sep 3, 2026 17:2725,971135,673,828126,188,0001,070,0002,117,632stderr
5Sep 3, 2026 17:2725,973135,733,037126,236,0001,032,0002,117,632stderr
6Sep 3, 2026 17:2725,994137,051,487126,282,0001,091,0002,117,632stderr
7Sep 3, 2026 17:2725,995135,874,322126,262,0001,117,0002,117,632stderr
8Sep 3, 2026 17:2726,021135,983,681126,415,0001,090,0002,117,632stderr
9Sep 3, 2026 17:2726,031136,104,723126,354,0001,198,0002,117,632stderr