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 listSep 3, 2026 12:50Victor MerckléVictor MerckléScore: 25,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:5625,617133,927,938124,432,0001,093,0002,117,632stderr
2Sep 3, 2026 12:5625,628134,029,593124,484,0001,094,0002,117,632stderr
3Sep 3, 2026 12:5625,630134,085,622124,497,0001,094,0002,117,632stderr
4Sep 3, 2026 12:5625,632134,056,326124,504,0001,097,0002,117,632stderr
5Sep 3, 2026 12:5625,635134,043,876124,529,0001,084,0002,117,632stderr
6Sep 3, 2026 12:5625,636134,041,140124,535,0001,084,0002,117,632stderr
7Sep 3, 2026 12:5625,641134,195,497124,524,0001,121,0002,117,632stderr
8Sep 3, 2026 12:5625,644134,183,504124,554,0001,106,0002,117,632stderr
9Sep 3, 2026 12:5625,650134,200,678124,585,0001,104,0002,117,632stderr