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 listJan 16, 2025 01:12Ian MckibbenIan MckibbenScore: 1,068,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 01:121,063,6555,236,889,8145,208,910,0002,998,0002,265,088
2Jan 16, 2025 01:121,068,1535,264,722,8015,231,950,0001,998,0002,281,472
3Jan 16, 2025 01:121,068,5305,264,937,0745,232,800,0002,998,0002,281,472