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:42Victor MerckléVictor MerckléScore: 32,647Success
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:4332,570167,971,979158,587,0001,009,0002,117,632stderr
2Aug 25, 2026 02:4332,573168,324,064158,601,0001,011,0002,117,632stderr
3Aug 25, 2026 02:4332,577168,199,744158,618,0001,012,0002,117,632stderr
4Aug 25, 2026 02:4332,617168,192,257158,815,0001,010,0002,117,632stderr
5Aug 25, 2026 02:4332,647168,336,594158,964,0001,010,0002,117,632stderr
6Aug 25, 2026 02:4332,673168,462,573158,030,0002,071,0002,117,632stderr
7Aug 25, 2026 02:4332,720168,704,566159,320,0001,009,0002,117,632stderr
8Aug 25, 2026 02:4332,725168,749,196159,343,0001,012,0002,117,632stderr
9Aug 25, 2026 02:4332,850169,360,537159,959,0001,010,0002,117,632stderr