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 15:54Kevin HeaveyKevin HeaveyScore: 48,366Success
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 15:5548,289246,697,830234,764,0001,853,00020,480
2Jul 27, 2026 15:5548,309246,772,495234,817,0001,901,00020,480
3Jul 27, 2026 15:5548,362247,079,481233,907,0003,071,00020,480
4Jul 27, 2026 15:5548,364246,971,302233,929,0003,058,0002,113,536
5Jul 27, 2026 15:5548,366247,102,299233,931,0003,066,00020,480
6Jul 27, 2026 15:5548,386247,140,625234,009,0003,083,0002,113,536
7Jul 27, 2026 15:5548,394247,189,434233,921,0003,213,0002,113,536
8Jul 27, 2026 15:5548,397247,230,734234,013,0003,136,00020,480
9Jul 27, 2026 15:5548,904250,022,819237,629,0002,002,00020,480