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 5, 2021 17:25Dmitry KashtanovDmitry KashtanovScore: 2,723,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 17:252,617,26212,884,695,73112,824,586,18102,187,264
2May 5, 2021 17:252,619,07412,939,758,75212,833,462,41302,191,360
3May 5, 2021 17:252,639,46712,987,987,72912,933,386,90502,199,552
4May 5, 2021 17:252,723,04313,399,922,43513,342,912,87702,195,456
5May 5, 2021 17:252,724,05513,406,635,74813,347,870,95002,203,648
6May 5, 2021 17:252,725,94713,414,835,98413,357,141,05802,203,648