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 listJun 25, 2026 13:25Victor MerckléVictor MerckléScore: 49,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 13:2549,511250,228,832240,406,0002,198,0002,113,536
2Jun 25, 2026 13:2549,513250,189,566240,472,0002,146,0002,113,536
3Jun 25, 2026 13:2549,552250,472,476240,601,0002,208,0002,113,536
4Jun 25, 2026 13:2549,567250,431,805240,871,0002,010,0002,113,536
5Jun 25, 2026 13:2549,603250,697,567241,046,0002,009,0002,113,536
6Jun 25, 2026 13:2549,626250,853,668241,004,0002,166,0002,113,536
7Jun 25, 2026 13:2549,683251,051,577241,293,0002,158,0002,113,536
8Jun 25, 2026 13:2549,690251,454,304241,270,0002,214,0002,113,536
9Jun 25, 2026 13:2550,202253,760,621243,947,0002,044,0002,113,536