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 29, 2025 02:08zielajzielajScore: 24,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2025 02:0824,552144,942,928117,296,0003,007,0002,457,600
2Jul 29, 2025 02:0824,554146,207,152120,313,00002,461,696
3Jul 29, 2025 02:0824,557143,046,370119,329,0001,002,0002,330,624
4Jul 29, 2025 02:0824,559140,949,133119,335,0001,002,0002,318,336
5Jul 29, 2025 02:0824,566141,644,819118,366,0002,006,0002,469,888
6Jul 29, 2025 02:0824,568141,317,197118,378,0002,006,0002,457,600
7Jul 29, 2025 02:0824,573144,672,280119,407,0001,003,0002,482,176
8Jul 29, 2025 02:0824,588145,874,003120,481,00002,318,336
9Jul 29, 2025 02:0825,556145,481,925125,225,00002,289,664