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 14:05Victor MerckléVictor MerckléScore: 25,802Success
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 14:0725,794134,880,437125,293,0001,098,0002,117,632stderr
2Sep 2, 2026 14:0725,798134,909,289125,318,0001,093,0002,117,632stderr
3Sep 2, 2026 14:0725,798134,778,324125,309,0001,105,0002,117,632stderr
4Sep 2, 2026 14:0725,800134,828,063125,326,0001,094,0002,117,632stderr
5Sep 2, 2026 14:0725,802134,867,183125,320,0001,114,0002,117,632stderr
6Sep 2, 2026 14:0725,802135,542,284125,335,0001,097,0002,117,632stderr
7Sep 2, 2026 14:0725,804134,887,505125,360,0001,084,0002,117,632stderr
8Sep 2, 2026 14:0725,812134,884,631125,389,0001,092,0002,117,632stderr
9Sep 2, 2026 14:0725,826134,984,500125,443,0001,108,0002,117,632stderr