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 17:08Victor MerckléVictor MerckléScore: 25,568Success
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 17:0925,551133,659,273124,179,0001,023,0002,117,632stderr
2Sep 3, 2026 17:0925,566133,880,319124,182,0001,092,0002,117,632stderr
3Sep 3, 2026 17:0925,568133,763,511124,190,0001,096,0002,117,632stderr
4Sep 3, 2026 17:0925,568133,542,057124,173,0001,113,0002,117,632stderr
5Sep 3, 2026 17:0925,568133,825,897124,173,0001,115,0002,117,632stderr
6Sep 3, 2026 17:0925,570134,366,062124,200,0001,093,0002,117,632stderr
7Sep 3, 2026 17:0925,572134,335,491124,206,0001,097,0002,117,632stderr
8Sep 3, 2026 17:0925,586133,804,762124,277,0001,099,0002,117,632stderr
9Sep 3, 2026 17:0925,600133,879,376124,306,0001,134,0002,117,632stderr