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 listJan 21, 2022 04:58Karam Jameel MooreKaram Jameel MooreScore: 6,163,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2022 04:586,163,41530,264,283,28230,200,732,52002,256,896
2Jan 21, 2022 04:586,163,64330,255,656,19930,201,849,61802,265,088
3Jan 21, 2022 04:586,164,18030,276,820,81030,204,482,87202,256,896