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:13Ian MckibbenIan MckibbenScore: 830,041Success
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:13829,9944,091,329,2254,064,974,0001,999,0002,289,664
2Jan 16, 2025 01:13829,9994,093,179,9844,063,997,0002,998,0002,289,664
3Jan 16, 2025 01:13830,0354,096,275,6884,064,172,0002,998,0002,289,664
4Jan 16, 2025 01:13830,0374,098,589,3134,065,182,0001,998,0002,531,328
5Jan 16, 2025 01:13830,0414,096,008,1234,065,201,0001,999,0002,281,472
6Jan 16, 2025 01:13830,0414,093,092,6514,066,202,000999,0002,289,664
7Jan 16, 2025 01:13830,0474,101,263,7824,065,229,0001,999,0002,289,664
8Jan 16, 2025 01:13830,0494,093,142,3794,065,244,0001,998,0002,281,472
9Jan 16, 2025 01:13830,1214,094,156,4614,064,596,0002,998,0002,289,664