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 18:20Victor MerckléVictor MerckléScore: 25,559Success
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 18:2025,539133,691,603124,051,0001,093,0002,117,632stderr
2Sep 3, 2026 18:2025,549133,673,466124,079,0001,114,0002,117,632stderr
3Sep 3, 2026 18:2025,556133,673,618124,139,0001,087,0002,117,632stderr
4Sep 3, 2026 18:2025,558133,680,918124,145,0001,091,0002,117,632stderr
5Sep 3, 2026 18:2025,559133,724,325124,151,0001,092,0002,117,632stderr
6Sep 3, 2026 18:2025,566133,692,268124,181,0001,097,0002,117,632stderr
7Sep 3, 2026 18:2025,574133,763,360124,195,0001,118,0002,117,632stderr
8Sep 3, 2026 18:2025,576133,835,620124,223,0001,101,0002,117,632stderr
9Sep 3, 2026 18:2025,580133,807,428124,255,0001,087,0002,117,632stderr