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 03:52Victor MerckléVictor MerckléScore: 28,013Success
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 03:5227,967145,436,865136,033,0001,010,0002,117,632stderr
2Aug 25, 2026 03:5227,976145,544,787136,075,0001,010,0002,117,632stderr
3Aug 25, 2026 03:5227,993146,113,974135,147,0002,022,0002,117,632stderr
4Aug 25, 2026 03:5228,008145,632,415136,233,0001,009,0002,117,632stderr
5Aug 25, 2026 03:5228,013145,668,588135,253,0002,013,0002,117,632stderr
6Aug 25, 2026 03:5228,033145,799,519135,345,0002,018,0002,117,632stderr
7Aug 25, 2026 03:5228,116146,141,348136,760,0001,010,0002,117,632stderr
8Aug 25, 2026 03:5228,178146,511,119137,067,0001,010,0002,117,632stderr
9Aug 25, 2026 03:5228,296146,997,987137,641,0001,010,0002,117,632stderr