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,266Success
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:4864,812327,673,776308,835,0008,746,0002,113,536
2Jul 27, 2026 14:4864,822327,933,847308,933,0008,695,00020,480
3Jul 27, 2026 14:4864,843328,119,566308,899,0008,836,0002,113,536
4Jul 27, 2026 14:4865,143329,291,105308,707,00010,494,0002,113,536
5Jul 27, 2026 14:4865,266329,907,897309,397,00010,409,00020,480
6Jul 27, 2026 14:4865,334331,170,588308,791,00011,349,0002,113,536
7Jul 27, 2026 14:4865,335330,163,848309,254,00010,888,00020,480
8Jul 27, 2026 14:4865,435330,647,488309,449,00011,187,00020,480
9Jul 27, 2026 14:4868,362345,056,309325,136,0009,840,0002,113,536