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 7, 2026 16:29Victor MerckléVictor MerckléScore: 32,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 16:3032,722168,245,938159,332,0001,007,0002,117,632stderr
2Jul 7, 2026 16:3032,828168,911,560159,853,0001,009,0002,117,632stderr
3Jul 7, 2026 16:3032,865168,860,739160,035,0001,007,0002,117,632stderr
4Jul 7, 2026 16:3032,946169,467,580160,430,0001,007,0002,117,632stderr
5Jul 7, 2026 16:3032,973169,404,919160,563,0001,009,0002,117,632stderr
6Jul 7, 2026 16:3033,093170,005,869161,150,0001,007,0002,117,632stderr
7Jul 7, 2026 16:3033,111170,138,290161,242,0001,006,0002,117,632stderr
8Jul 7, 2026 16:3033,197170,499,228161,661,0001,007,0002,117,632stderr
9Jul 7, 2026 16:3033,412171,828,080162,713,0001,006,0002,117,632stderr