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 22, 2021 16:33Yuriy LyfenkoYuriy LyfenkoScore: 115,182Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2021 16:34113,390619,433,080555,610,18202,183,168
2May 22, 2021 16:33114,115636,945,579559,165,18002,187,264
3May 22, 2021 16:34114,853625,846,546562,779,87702,306,048
4May 22, 2021 16:34115,182644,457,940564,393,57602,174,976
5May 22, 2021 16:33117,261642,372,448574,576,46802,179,072
6May 22, 2021 16:33120,764666,334,620591,745,83602,179,072