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:51Robert BurkeRobert BurkeScore: 55,385Success
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:5152,947320,705,281259,438,01702,174,976
2Oct 4, 2022 15:5152,971326,321,746259,557,34802,183,168
3Oct 4, 2022 15:5153,578324,423,314262,532,30702,187,264
4Oct 4, 2022 15:5155,353293,526,684270,230,0001,000,0002,281,472
5Oct 4, 2022 15:5155,378291,989,993270,351,0001,001,0002,449,408
6Oct 4, 2022 15:5155,382294,625,174270,369,0001,001,0002,441,216
7Oct 4, 2022 15:5155,385302,286,091270,384,0001,001,0002,445,312
8Oct 4, 2022 15:5155,423296,229,691269,576,0001,996,0002,281,472
9Oct 4, 2022 15:5155,442294,460,092270,668,000998,0002,535,424
10Oct 4, 2022 15:5155,447297,276,358269,695,0001,997,0002,281,472
11Oct 4, 2022 15:5155,832294,873,151271,581,0001,996,0002,273,280
12Oct 4, 2022 15:5155,969300,715,711273,247,0001,000,0002,445,312