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 1, 2021 08:01gchebanovgchebanovScore: 177,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2021 08:00177,188953,759,473868,218,93402,224,128
2Jul 1, 2021 08:01177,357940,648,321869,049,76402,211,840
3Jul 1, 2021 08:01177,378924,049,739869,152,58702,232,320
4Jul 1, 2021 08:01177,610927,905,472870,291,18502,232,320
5Jul 1, 2021 08:00177,612931,544,175870,300,85002,228,224
6Jul 1, 2021 08:01177,676940,888,570870,611,33402,224,128
7Jul 1, 2021 08:01179,667953,770,384880,370,36802,220,032
8Jul 1, 2021 08:01179,756933,000,071880,806,58102,228,224
9Jul 1, 2021 08:00179,757934,690,401880,811,63302,228,224