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 3, 2026 12:02Victor MerckléVictor MerckléScore: 30,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 12:0230,391158,025,844147,903,0001,014,0002,117,632stderr
2Aug 3, 2026 12:0230,399157,378,664147,948,0001,010,0002,117,632stderr
3Aug 3, 2026 12:0230,410157,406,031148,005,0001,008,0002,117,632stderr
4Aug 3, 2026 12:0230,429157,810,435148,095,0001,011,0002,117,632stderr
5Aug 3, 2026 12:0230,518157,884,081148,531,0001,009,0002,117,632stderr
6Aug 3, 2026 12:0230,572158,208,487148,796,0001,010,0002,117,632stderr
7Aug 3, 2026 12:0230,657158,563,533149,214,0001,009,0002,117,632stderr
8Aug 3, 2026 12:0230,740159,378,755149,619,0001,009,0002,117,632stderr
9Aug 3, 2026 12:0230,847159,565,251150,142,0001,011,0002,117,632stderr