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 04:57Victor MerckléVictor MerckléScore: 29,237Success
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 04:5729,030150,619,086140,237,0002,012,0002,117,632stderr
2Aug 25, 2026 04:5729,119151,057,098141,677,0001,010,0002,117,632stderr
3Aug 25, 2026 04:5729,148151,203,571141,817,0001,009,0002,117,632stderr
4Aug 25, 2026 04:5729,149151,165,566140,829,0002,005,0002,117,632stderr
5Aug 25, 2026 04:5729,237151,614,031141,196,0002,067,0002,117,632stderr
6Aug 25, 2026 04:5729,240151,690,782141,235,0002,044,0002,117,632stderr
7Aug 25, 2026 04:5729,472152,878,864142,395,0002,018,0002,117,632stderr
8Aug 25, 2026 04:5729,691153,849,214143,481,0002,005,0002,117,632stderr
9Aug 25, 2026 04:5729,874154,847,836145,372,0001,013,0002,117,632stderr