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 11:45Robert BurkeRobert BurkeScore: 61,615Success
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 11:4558,950354,316,094288,854,61602,183,168
2Oct 4, 2022 11:4559,074354,086,848289,463,41202,179,072
3Oct 4, 2022 11:4559,187346,176,978290,014,49702,174,976
4Oct 4, 2022 11:4561,582329,237,906299,752,0001,998,0002,445,312
5Oct 4, 2022 11:4561,585322,969,198299,769,0001,998,0002,281,472
6Oct 4, 2022 11:4561,601322,966,870299,846,0001,998,0002,281,472
7Oct 4, 2022 11:4561,615325,732,520299,915,0001,999,0002,281,472
8Oct 4, 2022 11:4561,618325,827,823299,927,0001,999,0002,281,472
9Oct 4, 2022 11:4561,620324,426,796299,938,0001,999,0002,281,472
10Oct 4, 2022 11:4561,735327,747,991301,499,0001,001,0002,441,216
11Oct 4, 2022 11:4562,058330,678,218302,083,0002,000,0002,535,424
12Oct 4, 2022 11:4562,431332,256,159303,915,0001,999,0002,281,472