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:07Victor MerckléVictor MerckléScore: 25,478Success
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:0825,458133,166,807123,732,0001,016,0002,117,632stderr
2Sep 3, 2026 18:0825,465133,228,782123,762,0001,020,0002,117,632stderr
3Sep 3, 2026 18:0825,469133,270,905123,783,0001,016,0002,117,632stderr
4Sep 3, 2026 18:0825,477133,631,803123,728,0001,112,0002,117,632stderr
5Sep 3, 2026 18:0825,478133,306,889123,750,0001,097,0002,117,632stderr
6Sep 3, 2026 18:0825,487139,285,993123,787,0001,103,0002,117,632stderr
7Sep 3, 2026 18:0825,489133,398,752123,807,0001,092,0002,117,632stderr
8Sep 3, 2026 18:0825,500133,439,169123,848,0001,103,0002,117,632stderr
9Sep 3, 2026 18:0825,519134,744,902123,935,0001,111,0002,117,632stderr