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 05:46Victor MerckléVictor MerckléScore: 49,774Success
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 05:4749,665251,336,764241,338,0002,024,0002,117,632stderr
2Jul 3, 2026 05:4749,679251,331,289241,375,0002,055,0002,117,632stderr
3Jul 3, 2026 05:4749,681251,805,684241,384,0002,054,0002,117,632stderr
4Jul 3, 2026 05:4749,721251,364,400241,591,0002,044,0002,117,632stderr
5Jul 3, 2026 05:4749,774251,823,811241,849,0002,046,0002,117,632stderr
6Jul 3, 2026 05:4749,790251,948,795241,894,0002,080,0002,117,632stderr
7Jul 3, 2026 05:4749,812252,007,211242,013,0002,066,0002,117,632stderr
8Jul 3, 2026 05:4749,838252,197,651242,122,0002,089,0002,117,632stderr
9Jul 3, 2026 05:4750,060253,198,777243,220,0002,075,0002,117,632stderr