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 24, 2026 19:04Victor MerckléVictor MerckléScore: 28,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:0428,167146,685,480136,012,0002,011,0002,117,632stderr
2Aug 24, 2026 19:0428,202146,516,423136,140,0002,054,0002,117,632stderr
3Aug 24, 2026 19:0428,222146,702,726136,271,0002,019,0002,117,632stderr
4Aug 24, 2026 19:0428,237146,552,409136,327,0002,035,0002,117,632stderr
5Aug 24, 2026 19:0428,276146,701,689136,466,0002,088,0002,117,632stderr
6Aug 24, 2026 19:0428,378147,388,366138,046,0001,010,0002,117,632stderr
7Aug 24, 2026 19:0428,408147,665,053137,165,0002,036,0002,117,632stderr
8Aug 24, 2026 19:0428,454147,751,402138,418,0001,010,0002,117,632stderr
9Aug 24, 2026 19:0428,472147,911,858137,479,0002,036,0002,117,632stderr