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 28, 2026 00:30Kevin HeaveyKevin HeaveyScore: 114,041Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2026 08:03112,868563,080,388546,182,0006,872,0002,113,536
2Jul 28, 2026 08:03112,992563,782,224545,048,0008,613,00020,480
3Jul 28, 2026 08:03113,531566,626,636549,817,0006,487,00020,480
4Jul 28, 2026 08:03113,677567,877,052547,877,0009,144,00020,480
5Jul 28, 2026 08:03114,041568,752,760550,553,0008,250,00020,480
6Jul 28, 2026 08:03114,105569,101,178550,121,0008,998,0002,113,536
7Jul 28, 2026 08:03115,323575,061,057551,084,00014,000,0002,113,536
8Jul 28, 2026 08:03115,563576,299,091554,472,00011,789,0002,113,536
9Jul 28, 2026 08:03117,875587,704,498563,275,00014,316,0002,113,536