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 listJun 30, 2026 14:36Victor MerckléVictor MerckléScore: 59,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:3759,749300,664,406290,567,0002,206,0002,117,632stderr
2Jun 30, 2026 14:3759,754300,562,782290,760,0002,035,0002,117,632stderr
3Jun 30, 2026 14:3759,757300,720,639290,747,0002,066,0002,117,632stderr
4Jun 30, 2026 14:3759,782301,403,147290,892,0002,040,0002,117,632stderr
5Jun 30, 2026 14:3759,795300,708,106290,891,0002,108,0002,117,632stderr
6Jun 30, 2026 14:3759,805301,028,768290,850,0002,198,0002,117,632stderr
7Jun 30, 2026 14:3759,810301,081,584290,892,0002,177,0002,117,632stderr
8Jun 30, 2026 14:3760,026302,045,513292,004,0002,126,0002,117,632stderr
9Jun 30, 2026 14:3761,185307,751,900297,707,0002,102,0002,117,632stderr