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 14, 2025 21:30Valentin KofmanValentin KofmanScore: 127,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2025 21:30127,409652,457,798623,305,0001,000,0002,273,280
2Jul 14, 2025 21:30127,439646,858,104623,450,000999,0002,273,280
3Jul 14, 2025 21:30127,519653,388,293622,842,0001,999,0002,273,280
4Jul 14, 2025 21:30127,740646,791,326624,926,000999,0002,510,848
5Jul 14, 2025 21:30127,758647,868,294625,012,0001,000,0002,273,280
6Jul 14, 2025 21:30130,352663,870,317636,724,0001,999,0002,273,280
7Jul 14, 2025 21:30130,363661,865,335637,779,000999,0002,273,280
8Jul 14, 2025 21:30130,484671,707,061638,374,000999,0002,400,256
9Jul 14, 2025 21:30132,204673,670,670645,799,0001,999,0002,396,160