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 4, 2026 04:33Victor MerckléVictor MerckléScore: 47,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 04:3447,432240,310,382230,330,0002,090,0002,117,632stderr
2Jul 4, 2026 04:3447,434240,400,688230,308,0002,119,0002,117,632stderr
3Jul 4, 2026 04:3447,440240,416,816230,303,0002,153,0002,117,632stderr
4Jul 4, 2026 04:3447,450240,458,012230,414,0002,095,0002,117,632stderr
5Jul 4, 2026 04:3447,470240,992,877230,391,0002,215,0002,117,632stderr
6Jul 4, 2026 04:3447,475240,562,040230,605,0002,025,0002,117,632stderr
7Jul 4, 2026 04:3447,486241,098,426230,488,0002,197,0002,117,632stderr
8Jul 4, 2026 04:3447,637241,333,695231,287,0002,138,0002,117,632stderr
9Jul 4, 2026 04:3448,198244,192,201234,002,0002,172,0002,117,632stderr