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 00:05Victor MerckléVictor MerckléScore: 34,740Success
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 00:0634,581177,863,787168,420,0001,029,0002,117,632stderr
2Sep 2, 2026 00:0634,683178,431,449168,934,0001,015,0002,117,632stderr
3Sep 2, 2026 00:0634,723178,590,500169,006,0001,141,0002,117,632stderr
4Sep 2, 2026 00:0634,731179,070,568169,086,0001,096,0002,117,632stderr
5Sep 2, 2026 00:0634,740178,622,527169,134,0001,095,0002,117,632stderr
6Sep 2, 2026 00:0634,753178,743,863169,195,0001,095,0002,117,632stderr
7Sep 2, 2026 00:0634,882179,312,461169,833,0001,091,0002,117,632stderr
8Sep 2, 2026 00:0634,884179,371,787169,826,0001,107,0002,117,632stderr
9Sep 2, 2026 00:0634,893179,398,316169,883,0001,096,0002,117,632stderr