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 4, 2026 09:22Victor MerckléVictor MerckléScore: 25,352Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 09:2525,345132,615,839123,173,0001,020,0002,117,632stderr
2Sep 4, 2026 09:2525,347132,668,069123,179,0001,025,0002,117,632stderr
3Sep 4, 2026 09:2525,351132,654,475123,192,0001,028,0002,117,632stderr
4Sep 4, 2026 09:2525,351132,621,422123,196,0001,025,0002,117,632stderr
5Sep 4, 2026 09:2525,352132,644,589123,212,0001,017,0002,117,632stderr
6Sep 4, 2026 09:2525,357132,798,273123,191,0001,063,0002,117,632stderr
7Sep 4, 2026 09:2525,379132,914,290123,272,0001,089,0002,117,632stderr
8Sep 4, 2026 09:2525,412132,915,942123,283,0001,236,0002,117,632stderr
9Sep 4, 2026 09:2525,426133,116,159123,479,0001,109,0002,117,632stderr