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 3, 2026 17:04Victor MerckléVictor MerckléScore: 48,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:0648,499245,547,857235,593,0002,055,0002,117,632stderr
2Jul 3, 2026 17:0648,517245,531,513235,691,0002,044,0002,117,632stderr
3Jul 3, 2026 17:0648,527245,875,049235,750,0002,034,0002,117,632stderr
4Jul 3, 2026 17:0648,540245,784,591235,754,0002,093,0002,117,632stderr
5Jul 3, 2026 17:0648,540245,588,355235,824,0002,022,0002,117,632stderr
6Jul 3, 2026 17:0648,571245,935,046235,958,0002,041,0002,117,632stderr
7Jul 3, 2026 17:0648,572246,340,536235,906,0002,097,0002,117,632stderr
8Jul 3, 2026 17:0648,602246,088,432236,103,0002,050,0002,117,632stderr
9Jul 3, 2026 17:0649,987253,256,218242,927,0002,013,0002,117,632stderr