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 listJul 3, 2021 20:13Vitaliy F.Vitaliy F.Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2021 20:1100000Error: expected "560376178930 ", got "560376178402 "
2Jul 3, 2021 20:1200000Error: expected "560373089673 ", got "560373089625 "
3Jul 3, 2021 20:13870,0604,324,733,2944,263,294,54002,273,280
4Jul 3, 2021 20:13870,0684,326,941,8124,263,334,36202,265,088
5Jul 3, 2021 20:13870,1344,328,213,4444,263,656,43102,269,184