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 3, 2026 17:35Victor MerckléVictor MerckléScore: 47,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:3547,589241,185,783231,160,0002,029,0002,117,632stderr
2Jul 3, 2026 17:3547,601240,945,615231,223,0002,022,0002,117,632stderr
3Jul 3, 2026 17:3547,602241,226,738231,236,0002,015,0002,117,632stderr
4Jul 3, 2026 17:3547,632241,351,153232,390,0001,007,0002,117,632stderr
5Jul 3, 2026 17:3547,643241,392,294231,416,0002,035,0002,117,632stderr
6Jul 3, 2026 17:3547,661241,458,777231,502,0002,039,0002,117,632stderr
7Jul 3, 2026 17:3547,671241,558,795231,571,0002,018,0002,117,632stderr
8Jul 3, 2026 17:3547,710241,996,977232,772,0001,009,0002,117,632stderr
9Jul 3, 2026 17:3550,165253,753,102244,802,0001,007,0002,117,632stderr