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 listJul 25, 2022 01:06evgenikwtevgenikwtScore: 171,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2022 01:06171,057897,987,787838,180,90702,228,224
2Dec 6, 2021 13:37171,084902,835,425838,313,22902,252,800
3Dec 6, 2021 13:37171,127905,643,585838,520,50602,236,416
4Dec 6, 2021 13:37171,353911,681,209839,628,15402,232,320
5Jul 25, 2022 01:06171,380921,967,106839,762,36702,244,608
6Jul 25, 2022 01:06172,170914,189,061843,631,16902,248,704