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 13:29Victor MerckléVictor MerckléScore: 25,950Success
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 13:3225,907135,344,939125,917,0001,032,0002,117,632stderr
2Sep 2, 2026 13:3225,944135,522,499126,031,0001,097,0002,117,632stderr
3Sep 2, 2026 13:3225,946135,514,550126,048,0001,091,0002,117,632stderr
4Sep 2, 2026 13:3225,948135,562,437126,062,0001,086,0002,117,632stderr
5Sep 2, 2026 13:3225,950135,636,198126,062,0001,093,0002,117,632stderr
6Sep 2, 2026 13:3225,951135,550,151126,072,0001,091,0002,117,632stderr
7Sep 2, 2026 13:3225,952135,626,142126,065,0001,100,0002,117,632stderr
8Sep 2, 2026 13:3225,968135,636,042126,142,0001,106,0002,117,632stderr
9Sep 2, 2026 13:3225,975135,693,952126,019,0001,263,0002,117,632stderr