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 11, 2026 14:54Victor MerckléVictor MerckléScore: 95,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 14:5595,888480,220,087467,772,0002,081,0002,113,536
2May 11, 2026 14:5595,918478,749,238467,960,0002,042,0002,113,536
3May 11, 2026 14:5595,946479,993,405468,025,0002,114,0002,113,536
4May 11, 2026 14:5595,962481,992,813468,139,0002,079,0002,113,536
5May 11, 2026 14:5595,965479,485,351468,136,0002,093,0002,113,536
6May 11, 2026 14:5595,985481,378,446468,310,0002,018,0002,113,536
7May 11, 2026 14:5596,017481,162,792468,443,0002,041,0002,113,536
8May 11, 2026 14:5596,050479,417,268468,564,0002,084,0002,113,536
9May 11, 2026 14:5596,062479,472,766468,696,0002,009,0002,113,536