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 08:32Victor MerckléVictor MerckléScore: 27,408Success
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 08:3327,298142,155,764132,745,0001,017,0002,117,632stderr
2Aug 25, 2026 08:3327,385142,592,702133,085,0001,103,0002,117,632stderr
3Aug 25, 2026 08:3327,389142,668,210133,082,0001,126,0002,117,632stderr
4Aug 25, 2026 08:3327,396142,654,748133,138,0001,103,0002,117,632stderr
5Aug 25, 2026 08:3327,408142,681,604133,209,0001,093,0002,117,632stderr
6Aug 25, 2026 08:3327,413142,715,190133,210,0001,118,0002,117,632stderr
7Aug 25, 2026 08:3327,417142,701,138133,236,0001,108,0002,117,632stderr
8Aug 25, 2026 08:3327,421142,852,274133,273,0001,091,0002,117,632stderr
9Aug 25, 2026 08:3327,444144,392,787133,334,0001,146,0002,117,632stderr