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:08Kevin HeaveyKevin HeaveyScore: 51,622Success
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:3751,214261,405,788242,189,0008,762,00020,480
2Jul 27, 2026 14:3751,238261,123,326242,013,0009,057,00020,480
3Jul 27, 2026 14:3751,336261,688,427242,147,0009,402,00020,480
4Jul 27, 2026 14:3751,501262,464,682242,800,0009,559,00020,480
5Jul 27, 2026 14:3751,622262,980,598242,994,0009,958,0002,113,536
6Jul 27, 2026 14:3751,655263,224,913242,156,00010,956,0002,113,536
7Jul 27, 2026 14:3751,745263,668,241242,267,00011,288,00020,480
8Jul 27, 2026 14:3751,781263,749,390242,002,00011,727,0002,113,536
9Jul 27, 2026 14:3752,012264,897,462242,114,00012,746,00020,480