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 listJun 13, 2026 03:31Victor MerckléVictor MerckléScore: 52,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 03:3852,679269,733,328256,110,0002,021,0002,113,536
2Jun 13, 2026 03:3852,695265,905,006256,177,0002,029,0002,113,536
3Jun 13, 2026 03:3852,709265,850,861256,250,0002,028,0002,113,536
4Jun 13, 2026 03:3852,711265,906,886256,176,0002,112,0002,113,536
5Jun 13, 2026 03:3852,714265,886,919256,259,0002,044,0002,113,536
6Jun 13, 2026 03:3852,757266,196,205256,329,0002,183,0002,113,536
7Jun 13, 2026 03:3852,785266,248,639256,611,0002,040,0002,113,536
8Jun 13, 2026 03:3852,787266,147,134256,650,0002,010,0002,113,536
9Jun 13, 2026 03:3852,812266,642,137256,687,0002,095,0002,113,536