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 02:28Victor MerckléVictor MerckléScore: 29,372Success
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 02:2929,223151,668,244142,186,0001,009,0002,117,632stderr
2Aug 25, 2026 02:2929,239151,630,519142,263,0001,009,0002,117,632stderr
3Aug 25, 2026 02:2929,322152,643,735142,671,0001,011,0002,117,632stderr
4Aug 25, 2026 02:2929,346152,182,452141,779,0002,020,0002,117,632stderr
5Aug 25, 2026 02:2929,372152,301,510141,914,0002,009,0002,117,632stderr
6Aug 25, 2026 02:2929,386160,223,117141,904,0002,092,0002,117,632stderr
7Aug 25, 2026 02:2929,391152,465,677141,973,0002,044,0002,117,632stderr
8Aug 25, 2026 02:2929,419152,582,401142,129,0002,028,0002,117,632stderr
9Aug 25, 2026 02:2929,453152,688,349143,312,0001,010,0002,117,632stderr