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 22:23Dmitry KashtanovDmitry KashtanovScore: 2,693,575Success
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 22:232,587,41612,746,981,20012,678,337,24702,248,704
2May 5, 2021 22:232,595,83612,773,787,52112,719,596,50902,244,608
3May 5, 2021 22:232,633,32412,963,148,27112,903,285,39702,244,608
4May 5, 2021 22:232,693,57513,266,021,79613,198,515,25102,244,608
5May 5, 2021 22:232,694,65213,271,382,69413,203,797,08102,252,800
6May 5, 2021 22:232,798,29113,777,822,13913,711,627,60802,240,512