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 7, 2026 17:23Victor MerckléVictor MerckléScore: 33,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 17:2333,068170,074,152155,447,0006,589,0002,117,632stderr
2Jul 7, 2026 17:2333,142170,203,131156,501,0005,898,00024,576stderr
3Jul 7, 2026 17:2333,192170,434,306156,280,0006,365,00024,576stderr
4Jul 7, 2026 17:2333,238170,792,153156,595,0006,273,00024,576stderr
5Jul 7, 2026 17:2333,288171,019,459156,975,0006,137,0002,117,632stderr
6Jul 7, 2026 17:2333,340171,206,897156,478,0006,892,0002,117,632stderr
7Jul 7, 2026 17:2333,395171,461,519157,244,0006,396,00024,576stderr
8Jul 7, 2026 17:2333,505172,025,417157,784,0006,392,00024,576stderr
9Jul 7, 2026 17:2333,669172,897,598158,224,0006,755,00024,576stderr