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 listJul 5, 2026 19:15Victor MerckléVictor MerckléScore: 37,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 19:1637,243190,270,616178,578,0003,913,00024,576stderr
2Jul 5, 2026 19:1637,370190,920,905179,036,0004,077,00024,576stderr
3Jul 5, 2026 19:1637,434191,258,856178,789,0004,640,00024,576stderr
4Jul 5, 2026 19:1637,488202,562,572179,616,0004,077,00024,576stderr
5Jul 5, 2026 19:1637,505191,618,947179,492,0004,285,00024,576stderr
6Jul 5, 2026 19:1637,561191,962,376179,762,0004,291,0002,117,632stderr
7Jul 5, 2026 19:1637,639192,269,696180,247,0004,187,00024,576stderr
8Jul 5, 2026 19:1637,720192,691,035180,348,0004,480,0002,117,632stderr
9Jul 5, 2026 19:1637,758193,465,941180,433,0004,583,00024,576stderr