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 08:38alex3dalex3dScore: 648,272Success
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 08:38603,5083,019,301,2202,957,189,61302,269,184
2May 24, 2021 08:38603,5373,002,997,6422,957,329,78702,273,280
3May 24, 2021 08:38603,7513,013,476,8162,958,380,33002,273,280
4May 24, 2021 08:38648,2723,244,109,5493,176,530,39702,273,280
5May 24, 2021 08:38648,3263,251,325,2883,176,796,15902,277,376
6May 24, 2021 08:38648,5643,248,517,9103,177,965,63002,281,472