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:50Victor MerckléVictor MerckléScore: 96,024Success
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:5195,916478,837,662467,951,0002,042,0002,113,536
2May 11, 2026 14:5195,931481,739,223468,029,0002,034,0002,113,536
3May 11, 2026 14:5195,950480,845,629468,106,0002,049,0002,113,536
4May 11, 2026 14:5195,978479,131,355468,258,0002,038,0002,113,536
5May 11, 2026 14:5196,024479,345,155468,434,0002,084,0002,113,536
6May 11, 2026 14:5196,063479,390,396468,696,0002,015,0002,113,536
7May 11, 2026 14:5196,064479,971,071468,660,0002,054,0002,113,536
8May 11, 2026 14:5196,066481,329,501468,680,0002,046,0002,113,536
9May 11, 2026 14:5196,085481,401,529468,804,0002,017,0002,113,536