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 04:29Victor MerckléVictor MerckléScore: 26,110Success
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 04:3026,093136,307,055126,838,0001,020,0002,117,632stderr
2Sep 2, 2026 04:3026,103136,309,528126,804,0001,103,0002,117,632stderr
3Sep 2, 2026 04:3026,107136,200,183126,830,0001,096,0002,117,632stderr
4Sep 2, 2026 04:3026,109136,368,903126,842,0001,095,0002,117,632stderr
5Sep 2, 2026 04:3026,110136,319,462126,848,0001,094,0002,117,632stderr
6Sep 2, 2026 04:3026,116137,471,976126,878,0001,094,0002,117,632stderr
7Sep 2, 2026 04:3026,118136,444,019126,889,0001,094,0002,117,632stderr
8Sep 2, 2026 04:3026,121136,453,215126,899,0001,094,0002,117,632stderr
9Sep 2, 2026 04:3026,137136,564,199126,968,0001,105,0002,117,632stderr