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 3, 2026 23:20Victor MerckléVictor MerckléScore: 25,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 23:2125,573133,804,796124,281,0001,030,0002,117,632stderr
2Sep 3, 2026 23:2125,578133,867,723124,297,0001,039,0002,117,632stderr
3Sep 3, 2026 23:2125,586135,117,479124,342,0001,030,0002,117,632stderr
4Sep 3, 2026 23:2125,592133,847,093124,305,0001,096,0002,117,632stderr
5Sep 3, 2026 23:2125,610133,922,099124,398,0001,091,0002,117,632stderr
6Sep 3, 2026 23:2125,615133,962,765124,399,0001,116,0002,117,632stderr
7Sep 3, 2026 23:2125,619134,213,401124,438,0001,099,0002,117,632stderr
8Sep 3, 2026 23:2125,656134,215,925124,530,0001,185,0002,117,632stderr
9Sep 3, 2026 23:2125,657134,204,578124,475,0001,245,0002,117,632stderr