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:52Robert BurkeRobert BurkeScore: 61,268Success
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:5259,701349,289,563292,534,75602,187,264
2Oct 4, 2022 11:5259,813347,801,102293,085,99502,179,072
3Oct 4, 2022 11:5261,212319,167,974297,939,0001,999,0002,531,328
4Oct 4, 2022 11:5261,219321,447,906297,974,0001,999,0002,281,472
5Oct 4, 2022 11:5261,219327,637,192297,976,0001,999,0002,281,472
6Oct 4, 2022 11:5261,233324,999,014298,040,0002,000,0002,441,216
7Oct 4, 2022 11:5261,268321,313,641299,214,0001,000,0002,449,408
8Oct 4, 2022 11:5261,300330,807,978299,371,0001,001,0002,281,472
9Oct 4, 2022 11:5261,533328,883,607300,512,0001,001,0002,281,472
10Oct 4, 2022 11:5262,055323,318,757303,069,0001,000,0002,441,216
11Oct 4, 2022 11:5262,949336,009,438307,448,0001,001,0002,437,120
12Oct 4, 2022 11:5263,418380,680,901310,748,65702,183,168