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 12:05Victor MerckléVictor MerckléScore: 25,855Success
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 12:0625,824135,022,083125,517,0001,023,0002,117,632stderr
2Sep 3, 2026 12:0625,836135,065,724125,491,0001,106,0002,117,632stderr
3Sep 3, 2026 12:0625,850134,962,689125,566,0001,102,0002,117,632stderr
4Sep 3, 2026 12:0625,854136,849,343125,577,0001,112,0002,117,632stderr
5Sep 3, 2026 12:0625,855135,277,934125,570,0001,121,0002,117,632stderr
6Sep 3, 2026 12:0625,860135,152,634125,608,0001,109,0002,117,632stderr
7Sep 3, 2026 12:0625,862135,211,736125,623,0001,101,0002,117,632stderr
8Sep 3, 2026 12:0625,863135,238,438125,624,0001,107,0002,117,632stderr
9Sep 3, 2026 12:0625,864135,145,770125,638,0001,099,0002,117,632stderr