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 17, 2026 13:47Victor MerckléVictor MerckléScore: 73,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 13:4873,566369,598,752358,257,0002,217,0002,113,536
2Jun 17, 2026 13:4873,582369,683,513358,386,0002,170,0002,113,536
3Jun 17, 2026 13:4873,593369,761,828358,596,0002,011,0002,113,536
4Jun 17, 2026 13:4873,602369,828,740358,458,0002,196,0002,113,536
5Jun 17, 2026 13:4873,633369,935,734358,597,0002,206,0002,113,536
6Jun 17, 2026 13:4873,642369,981,251358,720,0002,129,0002,113,536
7Jun 17, 2026 13:4873,897371,244,700359,848,0002,250,0002,113,536
8Jun 17, 2026 13:4874,033371,773,914360,624,0002,142,0002,113,536
9Jun 17, 2026 13:4874,249372,972,039361,628,0002,193,0002,113,536