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 18:42Victor MerckléVictor MerckléScore: 25,611Success
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 18:4325,567133,700,568124,259,0001,023,0002,117,632stderr
2Sep 3, 2026 18:4325,595133,834,868124,316,0001,100,0002,117,632stderr
3Sep 3, 2026 18:4325,607134,266,803124,362,0001,113,0002,117,632stderr
4Sep 3, 2026 18:4325,609134,005,566124,395,0001,092,0002,117,632stderr
5Sep 3, 2026 18:4325,611134,020,308124,386,0001,111,0002,117,632stderr
6Sep 3, 2026 18:4325,615134,023,162124,292,0001,223,0002,117,632stderr
7Sep 3, 2026 18:4325,617133,950,760124,431,0001,097,0002,117,632stderr
8Sep 3, 2026 18:4325,626134,058,112124,476,0001,095,0002,117,632stderr
9Sep 3, 2026 18:4325,635134,023,995124,395,0001,221,0002,117,632stderr