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 listMay 23, 2021 15:29Yuriy LyfenkoYuriy LyfenkoScore: 189,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2021 15:36182,345955,367,657893,491,30002,236,416
2May 23, 2021 15:29183,360973,758,675898,462,40502,240,512
3May 23, 2021 15:36189,085980,748,346926,514,43802,240,512
4May 23, 2021 15:29189,393996,030,340928,023,35902,244,608
5May 23, 2021 15:29190,729996,204,968934,573,52102,232,320
6May 23, 2021 15:36192,0711,005,240,329941,145,77502,232,320