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 17:26Kevin HeaveyKevin HeaveyScore: 49,354Success
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 17:2649,301251,479,675239,777,0001,802,00020,480
2Jul 27, 2026 17:2649,307251,686,464239,756,0001,853,00020,480
3Jul 27, 2026 17:2649,344251,693,658239,847,0001,942,00020,480
4Jul 27, 2026 17:2649,346251,874,839240,023,0001,774,00020,480
5Jul 27, 2026 17:2649,354251,758,101239,828,0002,011,00020,480
6Jul 27, 2026 17:2649,379253,315,362240,246,0001,714,00020,480
7Jul 27, 2026 17:2649,384252,738,106240,109,0001,874,00020,480
8Jul 27, 2026 17:2649,395253,657,085239,043,0002,997,00020,480
9Jul 27, 2026 17:2649,416252,104,775240,251,0001,891,00020,480