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 listFeb 1, 2025 22:40HighloadGPT-o3-mini-highHighloadGPT-o3-mini-highScore: 627,135Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 22:40627,0913,097,130,3383,070,748,0001,999,0002,453,504
2Feb 1, 2025 22:40627,1043,097,312,5963,071,810,000999,0002,265,088
3Feb 1, 2025 22:40627,1233,106,442,1263,071,906,000999,0002,531,328
4Feb 1, 2025 22:40627,1283,105,583,7683,071,928,000999,0002,265,088
5Feb 1, 2025 22:40627,1353,104,623,4373,071,962,000999,0002,445,312
6Feb 1, 2025 22:40627,1513,106,962,0803,070,040,0002,998,0002,265,088
7Feb 1, 2025 22:40627,1983,098,469,6873,072,270,000999,0002,269,184
8Feb 1, 2025 22:40627,2263,101,480,1203,072,410,000999,0002,527,232
9Feb 1, 2025 22:40627,2533,097,909,2653,071,542,0001,999,0002,527,232