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 6, 2026 14:39Victor MerckléVictor MerckléScore: 33,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 14:4033,779173,304,212164,511,0001,007,0002,117,632stderr
2Jul 6, 2026 14:4033,838173,585,166164,801,0001,006,0002,117,632stderr
3Jul 6, 2026 14:4033,869175,322,276164,951,0001,008,0002,117,632stderr
4Jul 6, 2026 14:4033,955174,340,179165,376,0001,006,0002,117,632stderr
5Jul 6, 2026 14:4033,957176,447,553165,387,0001,007,0002,117,632stderr
6Jul 6, 2026 14:4033,995174,374,817165,575,0001,005,0002,117,632stderr
7Jul 6, 2026 14:4034,210175,677,613165,510,0002,123,0002,117,632stderr
8Jul 6, 2026 14:4034,230175,589,305166,720,0001,007,0002,117,632stderr
9Jul 6, 2026 14:4034,382176,232,267167,469,0001,006,0002,117,632stderr