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 listMay 13, 2026 05:40Victor MerckléVictor MerckléScore: 63,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 05:4163,081319,870,508308,094,0001,006,0002,113,536
2May 13, 2026 05:4163,082317,591,392308,096,0001,007,0002,113,536
3May 13, 2026 05:4163,095317,808,140307,101,0002,068,0002,113,536
4May 13, 2026 05:4163,147317,833,176308,417,0001,006,0002,113,536
5May 13, 2026 05:4163,174318,887,131307,541,0002,012,0002,113,536
6May 13, 2026 05:4163,250318,364,923308,919,0001,006,0002,113,536
7May 13, 2026 05:4163,278319,877,813308,057,0002,010,0002,113,536
8May 13, 2026 05:4163,873321,402,287311,975,0001,006,0002,113,536
9May 13, 2026 05:4164,098322,903,095313,080,0001,005,0002,113,536