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 22:07Victor MerckléVictor MerckléScore: 59,832Success
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 22:0859,782300,880,547290,785,0002,151,0002,117,632stderr
2Jul 3, 2026 22:0859,802301,318,282290,904,0002,126,0002,117,632stderr
3Jul 3, 2026 22:0859,828301,580,361291,019,0002,143,0002,117,632stderr
4Jul 3, 2026 22:0859,829301,141,554291,015,0002,151,0002,117,632stderr
5Jul 3, 2026 22:0859,832301,205,029290,975,0002,203,0002,117,632stderr
6Jul 3, 2026 22:0859,850301,693,600291,113,0002,154,0002,117,632stderr
7Jul 3, 2026 22:0859,898301,800,527291,301,0002,201,0002,117,632stderr
8Jul 3, 2026 22:0859,898301,488,638291,352,0002,149,0002,117,632stderr
9Jul 3, 2026 22:0860,613305,061,303294,842,0002,163,0002,117,632stderr