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:14Kevin HeaveyKevin HeaveyScore: 52,573Success
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:4252,021265,008,219246,941,0007,966,00020,480
2Jul 27, 2026 14:4252,111265,510,684246,861,0008,484,0002,113,536
3Jul 27, 2026 14:4252,414266,896,945246,831,00010,001,00020,480
4Jul 27, 2026 14:4252,539267,827,084246,906,00010,536,00020,480
5Jul 27, 2026 14:4252,573267,630,360247,200,00010,410,00020,480
6Jul 27, 2026 14:4252,614267,867,281247,110,00010,699,00020,480
7Jul 27, 2026 14:4252,637268,080,996246,891,00011,031,00020,480
8Jul 27, 2026 14:4252,748269,004,946246,887,00011,583,00020,480
9Jul 27, 2026 14:4253,451272,680,494247,856,00014,054,00020,480