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 13:09Victor MerckléVictor MerckléScore: 25,828Success
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 13:1025,801134,813,496125,402,0001,023,0002,117,632stderr
2Sep 3, 2026 13:1025,812134,922,573125,459,0001,023,0002,117,632stderr
3Sep 3, 2026 13:1025,819135,188,161125,424,0001,090,0002,117,632stderr
4Sep 3, 2026 13:1025,823134,984,040125,446,0001,091,0002,117,632stderr
5Sep 3, 2026 13:1025,828134,990,229125,459,0001,102,0002,117,632stderr
6Sep 3, 2026 13:1025,830134,981,415125,475,0001,094,0002,117,632stderr
7Sep 3, 2026 13:1025,836135,029,152125,485,0001,114,0002,117,632stderr
8Sep 3, 2026 13:1025,850135,097,540125,575,0001,093,0002,117,632stderr
9Sep 3, 2026 13:1025,851136,322,052125,536,0001,136,0002,117,632stderr