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:36Victor MerckléVictor MerckléScore: 32,254Success
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:3632,219166,325,627156,777,0001,099,0002,117,632stderr
2Sep 2, 2026 02:3632,220166,587,913156,863,0001,015,0002,117,632stderr
3Sep 2, 2026 02:3632,230166,324,011156,839,0001,089,0002,117,632stderr
4Sep 2, 2026 02:3632,243166,381,376156,902,0001,090,0002,117,632stderr
5Sep 2, 2026 02:3632,254166,433,712156,998,0001,051,0002,117,632stderr
6Sep 2, 2026 02:3632,304167,048,195157,194,0001,100,0002,117,632stderr
7Sep 2, 2026 02:3632,358166,981,849157,463,0001,094,0002,117,632stderr
8Sep 2, 2026 02:3632,368166,876,662157,508,0001,100,0002,117,632stderr
9Sep 2, 2026 02:3632,375167,087,271157,530,0001,109,0002,117,632stderr