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 listDec 28, 2022 10:11Robert BurkeRobert BurkeScore: 60,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2022 10:1157,631347,821,792282,394,18602,179,072
2Dec 28, 2022 10:1157,763344,269,571283,039,96102,179,072
3Dec 28, 2022 10:1158,435348,204,918286,329,72302,183,168
4Dec 28, 2022 10:1160,905322,765,068297,434,0001,001,0002,277,376
5Dec 28, 2022 10:1160,907326,886,077297,444,0001,001,0002,445,312
6Dec 28, 2022 10:1160,933321,591,988296,575,0001,997,0002,273,280
7Dec 28, 2022 10:1160,989320,227,609296,847,0001,998,0002,281,472
8Dec 28, 2022 10:1161,139323,632,528297,585,0001,997,0002,535,424
9Dec 28, 2022 10:1161,215322,931,092297,956,0001,999,0002,281,472
10Dec 28, 2022 10:1161,276323,780,525299,253,0001,000,0002,281,472
11Dec 28, 2022 10:1161,632323,241,202299,998,0001,999,0002,277,376
12Dec 28, 2022 10:1161,665326,954,486300,159,0002,001,0002,281,472