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 09:38Robert BurkeRobert BurkeScore: 60,675Success
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 09:3859,606361,131,168292,067,26602,179,072
2Oct 4, 2022 09:3859,609360,884,733292,085,16402,183,168
3Oct 4, 2022 09:3859,620357,862,943292,135,67902,183,168
4Oct 4, 2022 09:3860,616316,019,003295,018,0002,000,0002,535,424
5Oct 4, 2022 09:3860,621318,500,287295,043,0002,000,0002,449,408
6Oct 4, 2022 09:3860,624319,973,596295,056,0002,000,0002,445,312
7Oct 4, 2022 09:3860,675316,506,844296,305,0001,001,0002,531,328
8Oct 4, 2022 09:3860,713322,373,933296,492,0001,001,0002,281,472
9Oct 4, 2022 09:3860,757320,911,024295,712,0001,998,0002,449,408
10Oct 4, 2022 09:3861,013320,438,967296,964,0001,999,0002,281,472
11Oct 4, 2022 09:3861,279321,541,609299,269,0001,000,0002,535,424
12Oct 4, 2022 09:3862,096322,937,783303,270,0001,000,0002,445,312