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 listMar 27, 2026 17:55Dominique GarmierDominique GarmierScore: 187,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 17:55187,237945,705,883916,464,000999,0002,281,472
2Mar 28, 2026 00:41187,237946,910,934915,462,0001,998,0002,396,160
3Mar 28, 2026 00:41187,266939,728,966916,605,000999,0002,506,752
4Mar 28, 2026 00:41187,287952,019,511917,708,00002,281,472
5Mar 27, 2026 17:55187,447943,729,667917,493,000999,0002,396,160
6Mar 27, 2026 17:55187,513946,928,497917,816,000999,0002,281,472