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 listAug 25, 2026 00:23Victor MerckléVictor MerckléScore: 42,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 00:2342,083214,591,252205,204,0001,007,0002,117,632stderr
2Aug 25, 2026 00:2342,107214,684,283204,318,0002,011,0002,117,632stderr
3Aug 25, 2026 00:2342,287215,769,065205,176,0002,031,0002,117,632stderr
4Aug 25, 2026 00:2342,310215,716,742205,299,0002,020,0002,117,632stderr
5Aug 25, 2026 00:2342,462216,428,795206,051,0002,015,0002,117,632stderr
6Aug 25, 2026 00:2342,478216,563,132206,126,0002,018,0002,117,632stderr
7Aug 25, 2026 00:2342,557217,632,292206,523,0002,008,0002,117,632stderr
8Aug 25, 2026 00:2342,729217,829,371208,365,0001,008,0002,117,632stderr
9Aug 25, 2026 00:2343,403221,027,050210,668,0002,010,0002,117,632stderr