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 4, 2026 14:01Victor MerckléVictor MerckléScore: 49,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:0249,017248,162,742238,178,0002,006,0002,117,632stderr
2Jul 4, 2026 14:0249,122248,661,825239,694,0001,006,0002,117,632stderr
3Jul 4, 2026 14:0249,191248,977,312240,032,0001,006,0002,117,632stderr
4Jul 4, 2026 14:0249,441250,243,880240,232,0002,031,0002,117,632stderr
5Jul 4, 2026 14:0249,454250,302,372240,260,0002,069,0002,117,632stderr
6Jul 4, 2026 14:0249,884253,818,636243,430,0001,006,0002,117,632stderr
7Jul 4, 2026 14:0250,046253,297,727243,166,0002,063,0002,117,632stderr
8Jul 4, 2026 14:0250,658256,648,051246,131,0002,097,0002,117,632stderr
9Jul 4, 2026 14:0251,315259,482,603249,419,0002,029,0002,117,632stderr