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 16:55Dmitry KashtanovDmitry KashtanovScore: 2,784,098Success
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 16:552,684,14713,236,133,39213,152,319,25702,203,648
2May 5, 2021 16:552,700,14113,294,130,38813,230,690,92302,195,456
3May 5, 2021 16:552,781,23213,696,638,29213,628,034,43302,187,264
4May 5, 2021 16:552,784,09813,717,469,59213,642,078,99902,207,744
5May 5, 2021 16:552,793,45513,753,220,28813,687,931,70402,191,360
6May 5, 2021 16:552,796,31613,764,103,27913,701,948,82002,203,648