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 8, 2026 09:30Victor MerckléVictor MerckléScore: 31,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 09:3131,634163,147,784153,999,0001,008,0002,117,632stderr
2Jul 8, 2026 09:3131,676163,110,357154,205,0001,010,0002,117,632stderr
3Jul 8, 2026 09:3131,723163,284,570154,433,0001,010,0002,117,632stderr
4Jul 8, 2026 09:3131,727163,396,886154,456,0001,010,0002,117,632stderr
5Jul 8, 2026 09:3131,735163,373,364154,492,0001,011,0002,117,632stderr
6Jul 8, 2026 09:3131,834163,824,958153,957,0002,030,0002,117,632stderr
7Jul 8, 2026 09:3131,873164,048,581155,170,0001,011,0002,117,632stderr
8Jul 8, 2026 09:3131,904164,241,173155,321,0001,013,0002,117,632stderr
9Jul 8, 2026 09:3132,060164,961,380156,086,0001,010,0002,117,632stderr