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 listAug 25, 2026 01:22Victor MerckléVictor MerckléScore: 29,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:2329,191151,384,930142,029,0001,010,0002,117,632stderr
2Aug 25, 2026 01:2329,269151,806,858141,398,0002,022,0002,117,632stderr
3Aug 25, 2026 01:2329,307151,972,723141,601,0002,006,0002,117,632stderr
4Aug 25, 2026 01:2329,347152,210,191142,792,0001,011,0002,117,632stderr
5Aug 25, 2026 01:2329,348152,280,451141,789,0002,021,0002,117,632stderr
6Aug 25, 2026 01:2329,352152,254,498141,820,0002,006,0002,117,632stderr
7Aug 25, 2026 01:2329,363152,239,758141,858,0002,021,0002,117,632stderr
8Aug 25, 2026 01:2329,407152,464,635142,080,0002,015,0002,117,632stderr
9Aug 25, 2026 01:2329,450152,757,377142,268,0002,039,0002,117,632stderr