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 3, 2026 21:00Victor MerckléVictor MerckléScore: 25,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:0125,746134,644,354125,066,0001,092,0002,117,632stderr
2Sep 3, 2026 21:0125,747134,596,189125,068,0001,095,0002,117,632stderr
3Sep 3, 2026 21:0125,753135,366,897125,089,0001,103,0002,117,632stderr
4Sep 3, 2026 21:0125,757134,656,114125,114,0001,099,0002,117,632stderr
5Sep 3, 2026 21:0125,760134,784,792125,125,0001,099,0002,117,632stderr
6Sep 3, 2026 21:0125,760134,653,112125,136,0001,088,0002,117,632stderr
7Sep 3, 2026 21:0125,763135,442,990125,098,0001,144,0002,117,632stderr
8Sep 3, 2026 21:0125,765134,703,425125,154,0001,096,0002,117,632stderr
9Sep 3, 2026 21:0125,786134,827,103125,258,0001,098,0002,117,632stderr