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:35Kevin HeaveyKevin HeaveyScore: 66,733Success
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:2566,227334,491,397316,524,0007,991,00020,480
2Jul 27, 2026 15:2566,262334,796,944316,710,0007,974,00020,480
3Jul 27, 2026 15:2566,539336,921,917316,909,0009,136,00020,480
4Jul 27, 2026 15:2566,673336,781,021316,566,00010,135,00020,480
5Jul 27, 2026 15:2566,733336,989,532316,955,00010,037,00020,480
6Jul 27, 2026 15:2566,753337,197,108316,732,00010,360,00020,480
7Jul 27, 2026 15:2566,865337,895,797316,489,00011,151,00020,480
8Jul 27, 2026 15:2566,930338,740,838316,538,00011,419,00020,480
9Jul 27, 2026 15:2567,409341,115,820321,771,0008,534,00020,480