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 24, 2026 19:57Victor MerckléVictor MerckléScore: 28,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:5828,361147,413,102136,959,0002,011,0002,117,632stderr
2Aug 24, 2026 19:5828,438147,775,384138,342,0001,008,0002,117,632stderr
3Aug 24, 2026 19:5828,497148,044,749138,626,0001,010,0002,117,632stderr
4Aug 24, 2026 19:5828,521149,022,582137,724,0002,029,0002,117,632stderr
5Aug 24, 2026 19:5828,727149,166,975139,757,0001,009,0002,117,632stderr
6Aug 24, 2026 19:5828,885149,866,646140,531,0001,010,0002,117,632stderr
7Aug 24, 2026 19:5828,958151,093,398140,887,0001,009,0002,117,632stderr
8Aug 24, 2026 19:5828,962150,283,599140,909,0001,009,0002,117,632stderr
9Aug 24, 2026 19:5829,067150,776,113141,424,0001,009,0002,117,632stderr