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:46alex3dalex3dScore: 451,335Success
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:46447,3722,258,913,6032,192,122,59102,269,184
2May 24, 2021 08:46447,5712,271,208,1862,193,098,72302,265,088
3May 24, 2021 08:46447,5892,264,338,4122,193,184,88802,277,376
4May 24, 2021 08:46451,3352,283,241,0702,211,541,94702,273,280
5May 24, 2021 08:46451,3922,277,748,5612,211,823,08002,273,280
6May 24, 2021 08:46451,9482,283,322,1952,214,546,19502,273,280