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 21, 2021 19:22Dmitry DolgopolovDmitry DolgopolovScore: 504,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2021 19:22452,4082,284,066,2542,216,798,15702,248,704
2May 21, 2021 19:22452,4412,278,993,6932,216,961,34402,256,896
3May 21, 2021 19:22452,5042,288,973,6892,217,267,67802,252,800
4May 21, 2021 19:22504,8542,522,900,4452,473,784,12202,256,896
5May 21, 2021 19:22504,8972,533,019,9442,473,993,44802,269,184
6May 21, 2021 19:22504,9352,541,017,3542,474,180,67602,256,896