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 13:08Kevin HeaveyKevin HeaveyScore: 53,961Success
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 13:2553,558272,479,004253,932,0008,506,00020,480
2Jul 27, 2026 13:2553,641272,914,871253,867,0008,976,00020,480
3Jul 27, 2026 13:2553,793273,712,031254,019,0009,569,00020,480
4Jul 27, 2026 13:2553,926276,614,877253,778,00010,463,00020,480
5Jul 27, 2026 13:2553,961274,497,654253,690,00010,719,00020,480
6Jul 27, 2026 13:2553,991274,552,353253,943,00010,617,00020,480
7Jul 27, 2026 13:2553,994274,534,912253,870,00010,704,00020,480
8Jul 27, 2026 13:2553,997274,639,137253,951,00010,637,00020,480
9Jul 27, 2026 13:2554,176275,502,304253,994,00011,470,00020,480