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 19, 2025 18:17zielajzielajScore: 30,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2025 18:1730,027168,312,529145,133,0002,001,0002,318,336
2Jul 19, 2025 18:1730,031168,538,962145,150,0002,002,0002,310,144
3Jul 19, 2025 18:1730,031167,285,275145,151,0002,002,0002,351,104
4Jul 19, 2025 18:1730,040169,836,359144,191,0003,003,0002,453,504
5Jul 19, 2025 18:1730,043165,851,832147,212,00002,326,528
6Jul 19, 2025 18:1730,049166,363,307145,235,0002,003,0002,469,888
7Jul 19, 2025 18:1730,093177,546,090146,453,0001,003,0002,457,600
8Jul 19, 2025 18:1731,170179,207,374151,736,000998,0002,473,984
9Jul 19, 2025 18:1731,817179,870,954152,903,0002,998,0002,342,912