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 27, 2026 14:23Kevin HeaveyKevin HeaveyScore: 65,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 14:4665,436330,871,732311,856,0008,783,00020,480
2Jul 27, 2026 14:4665,589332,252,110312,952,0008,436,00020,480
3Jul 27, 2026 14:4665,597331,484,708311,714,0009,716,00020,480
4Jul 27, 2026 14:4665,806333,216,589312,789,0009,663,00020,480
5Jul 27, 2026 14:4665,878333,660,206311,717,00011,090,00020,480
6Jul 27, 2026 14:4665,882333,626,403311,721,00011,103,0002,113,536
7Jul 27, 2026 14:4666,162334,276,132311,826,00012,372,00020,480
8Jul 27, 2026 14:4666,205334,526,497312,284,00012,123,0002,113,536
9Jul 27, 2026 14:4667,085338,847,433320,120,0008,601,00020,480