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 20, 2021 20:18Dmitry DolgopolovDmitry DolgopolovScore: 494,164Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2021 20:18461,3762,314,751,4632,260,740,30302,256,896
2May 20, 2021 20:18461,3822,326,579,9282,260,773,32602,265,088
3May 20, 2021 20:18461,4252,313,537,0112,260,981,37502,252,800
4May 20, 2021 20:18494,1642,492,213,5852,421,405,63602,248,704
5May 20, 2021 20:18494,2512,483,352,2282,421,829,94902,256,896
6May 20, 2021 20:18494,2852,486,252,9752,421,996,36402,248,704