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:26Dmitry KashtanovDmitry KashtanovScore: 2,723,487Success
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:262,626,16612,949,914,60312,868,211,59802,248,704
2May 5, 2021 17:262,627,06412,962,846,76712,872,612,79902,240,512
3May 5, 2021 17:262,630,28612,945,197,82112,888,403,18502,248,704
4May 5, 2021 17:262,723,48713,421,471,39713,345,085,10902,248,704
5May 5, 2021 17:262,724,27913,412,281,51813,348,968,26802,244,608
6May 5, 2021 17:262,848,05914,022,678,36113,955,491,49502,244,608