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 listJul 10, 2026 00:04Victor MerckléVictor MerckléScore: 30,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 00:0530,518157,710,426148,531,0001,008,0002,117,632stderr
2Jul 10, 2026 00:0530,546157,654,999147,588,0002,092,0002,117,632stderr
3Jul 10, 2026 00:0530,582157,909,466148,847,0001,009,0002,117,632stderr
4Jul 10, 2026 00:0530,582158,002,903148,847,0001,009,0002,117,632stderr
5Jul 10, 2026 00:0530,653158,149,546149,190,0001,011,0002,117,632stderr
6Jul 10, 2026 00:0530,697158,359,515149,409,0001,009,0002,117,632stderr
7Jul 10, 2026 00:0531,121161,943,793151,485,0001,009,0002,117,632stderr
8Jul 10, 2026 00:0531,124160,559,855151,503,0001,009,0002,117,632stderr
9Jul 10, 2026 00:0531,234161,219,787151,032,0002,015,0002,117,632stderr