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 30, 2025 23:49zielajzielajScore: 24,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2025 23:4924,261142,460,818116,882,0001,997,0002,453,504
2Jul 30, 2025 23:4924,265138,043,502117,898,000999,0002,285,568
3Jul 30, 2025 23:4924,266140,388,807116,906,0001,998,0002,330,624
4Jul 30, 2025 23:4924,269142,973,270117,918,000999,0002,314,240
5Jul 30, 2025 23:4924,269139,916,421115,921,0002,997,0002,322,432
6Jul 30, 2025 23:4924,274141,532,859117,946,000999,0002,531,328
7Jul 30, 2025 23:4924,284149,515,764117,994,000999,0002,478,080
8Jul 30, 2025 23:4924,287141,154,947117,007,0002,000,0002,334,720
9Jul 30, 2025 23:4926,148151,753,498126,122,0002,001,0002,318,336