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 09:21Victor MerckléVictor MerckléScore: 25,777Success
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 09:2125,763135,369,317125,141,0001,099,0002,117,632stderr
2Sep 2, 2026 09:2125,766134,683,466125,164,0001,094,0002,117,632stderr
3Sep 2, 2026 09:2125,770134,729,281125,175,0001,099,0002,117,632stderr
4Sep 2, 2026 09:2125,773134,781,900125,192,0001,098,0002,117,632stderr
5Sep 2, 2026 09:2125,777134,777,559125,211,0001,101,0002,117,632stderr
6Sep 2, 2026 09:2125,777134,734,281125,223,0001,089,0002,117,632stderr
7Sep 2, 2026 09:2125,784134,783,664125,203,0001,143,0002,117,632stderr
8Sep 2, 2026 09:2125,785134,893,477125,252,0001,096,0002,117,632stderr
9Sep 2, 2026 09:2125,787134,775,326125,268,0001,090,0002,117,632stderr