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 15:56Victor MerckléVictor MerckléScore: 94,087Success
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 15:5793,961469,949,719458,331,0002,081,0002,113,536
2May 11, 2026 15:5794,021471,643,509458,698,0002,008,0002,113,536
3May 11, 2026 15:5794,038471,345,657458,682,0002,108,0002,113,536
4May 11, 2026 15:5794,086470,581,841458,978,0002,047,0002,113,536
5May 11, 2026 15:5794,087470,182,263458,918,0002,109,0002,113,536
6May 11, 2026 15:5794,099471,666,872459,045,0002,043,0002,113,536
7May 11, 2026 15:5794,122472,097,172459,165,0002,037,0002,113,536
8May 11, 2026 15:5794,176470,838,495459,453,0002,010,0002,113,536
9May 11, 2026 15:5794,346482,034,485460,223,0002,077,0002,113,536