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 20, 2021 05:06Yuriy LyfenkoYuriy LyfenkoScore: 103,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2021 05:06100,098547,249,513490,479,09502,236,416
2May 20, 2021 05:08101,536565,574,630497,523,95202,244,608
3May 20, 2021 05:08103,668567,327,372507,975,36702,224,128
4May 20, 2021 05:06103,808568,520,028508,657,13002,232,320
5May 20, 2021 05:08105,280575,459,435515,869,61002,232,320
6May 20, 2021 05:06106,310579,295,716520,920,98002,220,032