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 2, 2026 08:16Victor MerckléVictor MerckléScore: 26,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 08:1726,241137,007,222127,560,0001,025,0002,117,632stderr
2Sep 2, 2026 08:1726,244137,681,216127,502,0001,096,0002,117,632stderr
3Sep 2, 2026 08:1726,249137,104,426127,513,0001,109,0002,117,632stderr
4Sep 2, 2026 08:1726,249137,053,342127,528,0001,093,0002,117,632stderr
5Sep 2, 2026 08:1726,258137,072,468127,578,0001,087,0002,117,632stderr
6Sep 2, 2026 08:1726,260137,217,374127,576,0001,099,0002,117,632stderr
7Sep 2, 2026 08:1726,262137,101,752127,586,0001,099,0002,117,632stderr
8Sep 2, 2026 08:1726,269137,143,832127,621,0001,101,0002,117,632stderr
9Sep 2, 2026 08:1726,273137,058,993127,652,0001,088,0002,117,632stderr