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 02:52Victor MerckléVictor MerckléScore: 29,278Success
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 02:5329,252151,620,459142,327,0001,012,0002,117,632stderr
2Sep 2, 2026 02:5329,252151,788,318142,312,0001,027,0002,117,632stderr
3Sep 2, 2026 02:5329,259151,743,718142,353,0001,018,0002,117,632stderr
4Sep 2, 2026 02:5329,276151,803,807142,368,0001,088,0002,117,632stderr
5Sep 2, 2026 02:5329,278151,895,907142,360,0001,105,0002,117,632stderr
6Sep 2, 2026 02:5329,280152,217,156142,368,0001,106,0002,117,632stderr
7Sep 2, 2026 02:5329,288151,923,078142,423,0001,093,0002,117,632stderr
8Sep 2, 2026 02:5329,293151,954,121142,385,0001,154,0002,117,632stderr
9Sep 2, 2026 02:5329,298151,850,770142,454,0001,108,0002,117,632stderr