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 9, 2026 22:41Victor MerckléVictor MerckléScore: 30,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:4230,456157,137,665147,229,0002,007,0002,117,632stderr
2Jul 9, 2026 22:4230,497157,526,460148,426,0001,010,0002,117,632stderr
3Jul 9, 2026 22:4230,530157,659,687148,591,0001,009,0002,117,632stderr
4Jul 9, 2026 22:4230,597157,789,405148,919,0001,010,0002,117,632stderr
5Jul 9, 2026 22:4230,632158,224,150149,090,0001,010,0002,117,632stderr
6Jul 9, 2026 22:4230,691158,246,516148,369,0002,017,0002,117,632stderr
7Jul 9, 2026 22:4230,705158,362,544148,445,0002,011,0002,117,632stderr
8Jul 9, 2026 22:4230,748158,754,802149,658,0001,009,0002,117,632stderr
9Jul 9, 2026 22:4231,085160,259,829151,310,0001,009,0002,117,632stderr