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 listSep 19, 2022 16:21Bernard TeoBernard TeoScore: 183,998Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2022 16:22183,964965,394,685901,423,63202,269,184
2Sep 19, 2022 16:21183,991970,122,187901,553,78202,265,088
3Sep 19, 2022 16:22183,996957,638,360901,578,36502,265,088
4Sep 19, 2022 16:21183,998969,564,438901,590,56302,269,184
5Sep 19, 2022 16:21184,010969,704,134901,650,68202,281,472
6Sep 19, 2022 16:22184,4981,133,137,086904,041,09902,265,088