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 16:00Victor MerckléVictor MerckléScore: 27,354Success
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 16:0027,282143,144,221132,661,0001,023,0002,117,632stderr
2Aug 25, 2026 16:0027,334142,293,268132,832,0001,105,0002,117,632stderr
3Aug 25, 2026 16:0027,345142,415,209132,908,0001,087,0002,117,632stderr
4Aug 25, 2026 16:0027,352142,391,794132,930,0001,095,0002,117,632stderr
5Aug 25, 2026 16:0027,354142,443,859132,935,0001,101,0002,117,632stderr
6Aug 25, 2026 16:0027,359142,513,426132,914,0001,147,0002,117,632stderr
7Aug 25, 2026 16:0027,360142,517,718133,064,0001,004,0002,117,632stderr
8Aug 25, 2026 16:0027,371143,283,305133,019,0001,099,0002,117,632stderr
9Aug 25, 2026 16:0027,372142,555,797133,022,0001,101,0002,117,632stderr