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 03:24Victor MerckléVictor MerckléScore: 26,288Success
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 03:2526,267136,926,478127,622,0001,091,0002,117,632stderr
2Sep 2, 2026 03:2526,270137,190,421127,622,0001,104,0002,117,632stderr
3Sep 2, 2026 03:2526,272137,125,747127,626,0001,110,0002,117,632stderr
4Sep 2, 2026 03:2526,279137,166,603127,632,0001,137,0002,117,632stderr
5Sep 2, 2026 03:2526,288137,210,148127,668,0001,147,0002,117,632stderr
6Sep 2, 2026 03:2526,292137,256,165127,737,0001,098,0002,117,632stderr
7Sep 2, 2026 03:2526,298137,251,159127,772,0001,090,0002,117,632stderr
8Sep 2, 2026 03:2526,300137,261,518127,764,0001,106,0002,117,632stderr
9Sep 2, 2026 03:2526,308137,275,486127,634,0001,279,0002,117,632stderr