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 24, 2021 09:04alex3dalex3dScore: 542,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 09:04505,6562,535,354,7832,477,715,53402,269,184
2May 24, 2021 09:04505,9922,550,094,3832,479,362,96702,269,184
3May 24, 2021 09:04506,0162,537,045,7692,479,478,01402,277,376
4May 24, 2021 09:04542,4852,727,989,9862,658,176,23302,252,800
5May 24, 2021 09:04542,8542,735,067,5132,659,982,66002,277,376
6May 24, 2021 09:04544,2562,739,049,5252,666,853,65002,277,376