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 listJul 5, 2026 04:50Victor MerckléVictor MerckléScore: 49,981Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 04:5149,787251,993,744241,907,0002,053,0002,117,632stderr
2Jul 5, 2026 04:5149,799251,969,222241,981,0002,035,0002,117,632stderr
3Jul 5, 2026 04:5149,829252,167,864242,066,0002,097,0002,117,632stderr
4Jul 5, 2026 04:5149,841252,231,257242,124,0002,097,0002,117,632stderr
5Jul 5, 2026 04:5149,981253,252,404242,855,0002,054,0002,117,632stderr
6Jul 5, 2026 04:5149,990252,924,820242,941,0002,012,0002,117,632stderr
7Jul 5, 2026 04:5150,005252,979,129242,910,0002,119,0002,117,632stderr
8Jul 5, 2026 04:5150,015256,567,367242,913,0002,162,0002,117,632stderr
9Jul 5, 2026 04:5150,023253,190,112243,090,0002,025,0002,117,632stderr