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 00:28Victor MerckléVictor MerckléScore: 28,593Success
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 00:2928,475148,009,409137,500,0002,030,0002,117,632stderr
2Aug 25, 2026 00:2928,486147,945,466138,574,0001,010,0002,117,632stderr
3Aug 25, 2026 00:2928,581148,487,915138,005,0002,042,0002,117,632stderr
4Aug 25, 2026 00:2928,586148,398,299139,065,0001,010,0002,117,632stderr
5Aug 25, 2026 00:2928,593148,548,076138,085,0002,023,0002,117,632stderr
6Aug 25, 2026 00:2928,636148,729,859139,308,0001,010,0002,117,632stderr
7Aug 25, 2026 00:2928,656148,777,307139,408,0001,010,0002,117,632stderr
8Aug 25, 2026 00:2928,720149,065,358139,721,0001,010,0002,117,632stderr
9Aug 25, 2026 00:2928,883149,875,710139,488,0002,041,0002,117,632stderr