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 17, 2021 23:53Yurkov AlekseyYurkov AlekseyScore: 647,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 23:53625,8993,131,772,9373,066,907,36102,285,568
2May 17, 2021 23:53625,9583,132,192,6773,067,193,61802,273,280
3May 17, 2021 23:53625,9803,134,328,2603,067,303,47502,273,280
4May 17, 2021 23:53647,7033,230,477,2153,173,742,65502,273,280
5May 17, 2021 23:53647,7223,232,507,7453,173,838,83202,273,280
6May 17, 2021 23:53647,7973,236,992,8363,174,204,24402,281,472