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 25, 2021 18:49Yurkov AlekseyYurkov AlekseyScore: 573,739Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2021 18:49573,6992,867,294,2532,811,125,54502,281,472
2May 25, 2021 18:48573,7002,848,142,9292,811,128,45702,273,280
3May 25, 2021 18:48573,7182,855,853,6152,811,216,24302,269,184
4May 25, 2021 18:49573,7392,884,019,3102,811,322,64902,277,376
5May 25, 2021 18:49573,7582,855,935,7692,811,415,37102,273,280
6May 25, 2021 18:48573,7942,879,084,3072,811,589,13102,260,992