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 05:03Victor MerckléVictor MerckléScore: 47,128Success
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 05:0446,927237,898,120227,912,0002,034,0002,117,632stderr
2Jul 5, 2026 05:0446,970238,129,229228,144,0002,009,0002,117,632stderr
3Jul 5, 2026 05:0447,055238,551,433228,530,0002,042,0002,117,632stderr
4Jul 5, 2026 05:0447,106238,772,223229,814,0001,008,0002,117,632stderr
5Jul 5, 2026 05:0447,128239,221,463228,862,0002,067,0002,117,632stderr
6Jul 5, 2026 05:0447,132238,970,867228,927,0002,022,0002,117,632stderr
7Jul 5, 2026 05:0447,142238,973,253228,893,0002,107,0002,117,632stderr
8Jul 5, 2026 05:0447,148238,991,387229,017,0002,011,0002,117,632stderr
9Jul 5, 2026 05:0447,826242,393,529232,279,0002,073,0002,117,632stderr