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 listSep 27, 2023 10:38apuxbtapuxbtScore: 236,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2023 10:38227,1111,173,071,8921,112,845,95402,260,992
2Sep 27, 2023 10:41228,3711,193,242,5611,119,019,45702,256,896
3Sep 27, 2023 10:41234,6071,207,877,6161,149,572,28202,256,896
4Sep 27, 2023 10:41236,4851,225,207,5691,158,778,11902,248,704
5Sep 27, 2023 10:38238,3581,230,389,7171,167,952,81302,240,512
6Sep 27, 2023 10:38246,4141,279,932,2741,207,426,94402,244,608