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 3, 2021 22:53Stanislav-PovolotskyStanislav-PovolotskyScore: 441,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2021 22:53405,8242,056,666,0851,988,536,35502,273,280
2May 3, 2021 22:53405,8622,050,803,9081,988,723,70202,281,472
3May 3, 2021 22:53405,8822,048,667,1221,988,820,22902,265,088
4May 3, 2021 22:53441,5082,234,218,9532,163,387,64002,281,472
5May 3, 2021 22:53441,5092,227,294,9842,163,395,85002,277,376
6May 3, 2021 22:53441,5662,234,094,4802,163,671,56402,269,184