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 listOct 4, 2022 15:02Robert BurkeRobert BurkeScore: 62,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 4, 2022 15:0260,779321,649,121295,819,0001,998,0002,281,472
2Oct 4, 2022 15:0260,809320,077,821295,964,0001,999,0002,445,312
3Oct 4, 2022 15:0260,899326,729,009297,405,0001,001,0002,445,312
4Oct 4, 2022 15:0260,921323,201,668297,512,0001,001,0002,281,472
5Oct 4, 2022 15:0261,287325,233,761299,307,0001,001,0002,281,472
6Oct 4, 2022 15:0261,360322,981,373298,665,0001,997,0002,441,216
7Oct 4, 2022 15:0262,733335,599,519306,389,0001,001,0002,281,472
8Oct 4, 2022 15:0262,816333,200,397305,799,0001,998,0002,281,472
9Oct 4, 2022 15:0263,379374,162,859310,556,94002,183,168
10Oct 4, 2022 15:0263,903376,200,862313,126,08202,179,072
11Oct 4, 2022 15:0263,954366,197,182313,376,63502,183,168
12Oct 4, 2022 15:0277,494402,010,627377,722,0001,998,0002,281,472