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 7, 2026 15:51Victor MerckléVictor MerckléScore: 32,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 15:5232,308166,168,948157,299,0001,011,0002,117,632stderr
2Jul 7, 2026 15:5232,397166,841,622157,736,0001,011,0002,117,632stderr
3Jul 7, 2026 15:5232,444169,888,758157,968,0001,010,0002,117,632stderr
4Jul 7, 2026 15:5232,479167,355,894158,139,0001,010,0002,117,632stderr
5Jul 7, 2026 15:5232,520167,174,888157,322,0002,027,0002,117,632stderr
6Jul 7, 2026 15:5232,553167,340,530158,504,0001,010,0002,117,632stderr
7Jul 7, 2026 15:5232,674167,936,498159,101,0001,006,0002,117,632stderr
8Jul 7, 2026 15:5232,772168,470,349159,573,0001,012,0002,117,632stderr
9Jul 7, 2026 15:5232,773168,632,097159,580,0001,008,0002,117,632stderr