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 22:43Victor MerckléVictor MerckléScore: 25,377Success
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 22:4425,359132,782,808123,174,0001,087,0002,117,632stderr
2Sep 3, 2026 22:4425,366132,776,686123,202,0001,096,0002,117,632stderr
3Sep 3, 2026 22:4425,367132,803,095123,208,0001,095,0002,117,632stderr
4Sep 3, 2026 22:4425,377133,124,235123,260,0001,090,0002,117,632stderr
5Sep 3, 2026 22:4425,377132,821,031123,253,0001,097,0002,117,632stderr
6Sep 3, 2026 22:4425,378132,894,365123,261,0001,094,0002,117,632stderr
7Sep 3, 2026 22:4425,382132,879,100123,247,0001,125,0002,117,632stderr
8Sep 3, 2026 22:4425,393132,879,113123,342,0001,087,0002,117,632stderr
9Sep 3, 2026 22:4425,403134,415,480123,365,0001,112,0002,117,632stderr