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 3, 2026 14:26Victor MerckléVictor MerckléScore: 50,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 14:2750,277254,525,654244,348,0002,010,0002,117,632stderr
2Jul 3, 2026 14:2750,282254,363,799244,363,0002,022,0002,117,632stderr
3Jul 3, 2026 14:2750,315254,452,639244,486,0002,062,0002,117,632stderr
4Jul 3, 2026 14:2750,340254,585,793244,620,0002,048,0002,117,632stderr
5Jul 3, 2026 14:2750,342254,395,807244,662,0002,016,0002,117,632stderr
6Jul 3, 2026 14:2750,388254,831,369244,845,0002,059,0002,117,632stderr
7Jul 3, 2026 14:2750,498255,355,768245,383,0002,058,0002,117,632stderr
8Jul 3, 2026 14:2750,650256,179,751246,106,0002,082,0002,117,632stderr
9Jul 3, 2026 14:2750,722256,438,008246,528,0002,011,0002,117,632stderr