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 18:05Robert BurkeRobert BurkeScore: 55,402Success
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 18:0552,975331,350,806259,575,90502,179,072
2Oct 4, 2022 18:0553,097326,205,471260,176,49302,179,072
3Oct 4, 2022 18:0553,228327,408,364260,818,52302,179,072
4Oct 4, 2022 18:0555,385295,993,399270,385,0001,001,0002,281,472
5Oct 4, 2022 18:0555,395294,289,899270,436,0001,001,0002,281,472
6Oct 4, 2022 18:0555,397297,408,382270,443,0001,001,0002,449,408
7Oct 4, 2022 18:0555,402297,608,878270,471,0001,001,0002,281,472
8Oct 4, 2022 18:0555,408302,332,132270,500,0001,001,0002,445,312
9Oct 4, 2022 18:0555,790300,355,786272,369,0001,001,0002,281,472
10Oct 4, 2022 18:0555,830298,614,004271,570,0001,996,0002,437,120
11Oct 4, 2022 18:0555,863298,217,947271,730,0001,998,0002,449,408
12Oct 4, 2022 18:0555,878294,964,688271,805,0001,998,0002,281,472