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 22:27Victor MerckléVictor MerckléScore: 25,501Success
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 22:2925,468133,236,214123,768,0001,026,0002,117,632stderr
2Sep 3, 2026 22:2925,481133,061,597123,819,0001,042,0002,117,632stderr
3Sep 3, 2026 22:2925,491133,362,571123,820,0001,087,0002,117,632stderr
4Sep 3, 2026 22:2925,495133,393,272123,835,0001,095,0002,117,632stderr
5Sep 3, 2026 22:2925,501133,370,392123,864,0001,094,0002,117,632stderr
6Sep 3, 2026 22:2925,501133,378,208123,872,0001,085,0002,117,632stderr
7Sep 3, 2026 22:2925,504133,365,116123,868,0001,106,0002,117,632stderr
8Sep 3, 2026 22:2925,504134,078,404123,866,0001,108,0002,117,632stderr
9Sep 3, 2026 22:2925,515133,444,551123,920,0001,104,0002,117,632stderr