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 19, 2026 20:55Victor MerckléVictor MerckléScore: 52,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 20:5652,832266,298,117256,767,0002,110,0002,113,536
2Jun 19, 2026 20:5652,845266,352,306256,890,0002,052,0002,113,536
3Jun 19, 2026 20:5652,857266,484,775256,953,0002,049,0002,113,536
4Jun 19, 2026 20:5652,864266,459,193256,993,0002,042,0002,113,536
5Jun 19, 2026 20:5652,865266,434,141257,032,0002,009,0002,113,536
6Jun 19, 2026 20:5652,873266,507,976256,928,0002,152,0002,113,536
7Jun 19, 2026 20:5652,879266,543,521256,973,0002,136,0002,113,536
8Jun 19, 2026 20:5652,880266,602,681257,036,0002,078,0002,113,536
9Jun 19, 2026 20:5654,724275,616,779266,091,0002,058,0002,113,536