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 12:25Victor MerckléVictor MerckléScore: 53,743Success
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 12:2553,546270,129,312261,376,0001,004,0002,117,632stderr
2Jul 5, 2026 12:2553,582270,542,324260,506,0002,046,0002,117,632stderr
3Jul 5, 2026 12:2553,695271,156,271261,085,0002,022,0002,117,632stderr
4Jul 5, 2026 12:2553,731271,174,088261,157,0002,129,0002,117,632stderr
5Jul 5, 2026 12:2553,743271,358,364261,295,0002,050,0002,117,632stderr
6Jul 5, 2026 12:2553,766271,450,395261,423,0002,035,0002,117,632stderr
7Jul 5, 2026 12:2553,817272,090,749261,524,0002,181,0002,117,632stderr
8Jul 5, 2026 12:2553,843271,797,060261,796,0002,037,0002,117,632stderr
9Jul 5, 2026 12:2554,737277,787,824266,209,0002,007,0002,117,632stderr