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 4, 2026 14:13Victor MerckléVictor MerckléScore: 47,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:1447,413240,734,530230,228,0002,097,0002,117,632stderr
2Jul 4, 2026 14:1447,418240,344,135230,301,0002,052,0002,117,632stderr
3Jul 4, 2026 14:1447,466240,370,273230,558,0002,030,0002,117,632stderr
4Jul 4, 2026 14:1447,471240,536,480230,561,0002,048,0002,117,632stderr
5Jul 4, 2026 14:1447,526240,980,826230,631,0002,247,0002,117,632stderr
6Jul 4, 2026 14:1447,709242,150,358231,715,0002,060,0002,117,632stderr
7Jul 4, 2026 14:1448,219244,282,496234,113,0002,163,0002,117,632stderr
8Jul 4, 2026 14:1448,530245,740,770235,767,0002,030,0002,117,632stderr
9Jul 4, 2026 14:1448,542245,840,416235,810,0002,047,0002,117,632stderr