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:23Victor MerckléVictor MerckléScore: 54,462Success
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:2954,350273,878,820264,261,0002,054,0002,113,536
2Jun 13, 2026 03:2954,374274,107,961264,384,0002,051,0002,113,536
3Jun 13, 2026 03:2954,435274,240,652264,652,0002,080,0002,113,536
4Jun 13, 2026 03:2954,443274,348,014264,709,0002,065,0002,113,536
5Jun 13, 2026 03:2954,462274,439,030264,743,0002,125,0002,113,536
6Jun 13, 2026 03:2954,515274,706,648265,055,0002,073,0002,113,536
7Jun 13, 2026 03:2954,727275,733,079266,044,0002,123,0002,113,536
8Jun 13, 2026 03:2954,748275,899,864266,249,0002,018,0002,113,536
9Jun 13, 2026 03:2955,011277,141,106267,466,0002,091,0002,113,536