Python and data for quants
A rolling mean, faster, part 3 of 3
ExpertMultiple choice
A rolling mean, faster · Part 3 of 3
You compute a 50-day rolling mean over a list p of 1,000 prices, producing one value for each full window. Count one read each time a price is fetched from the list.
To vectorise it you take c = np.cumsum(p) and form each window sum as c[i] - c[i - 50], on ten million prices near 10,000. The late windows come out slightly wrong. Why?
- ALate cumulative sums are near , where their rounding error is far larger than a window sum can absorb
- B
np.cumsumuses pairwise summation, which is less accurate than a plain loop - CThe cumulative sum overflows once it passes about two billion, because NumPy accumulates into a 32-bit integer by default
- DThe windows are misaligned by one element
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Report an issue with this question
Learn the method
Performance: profiling, vectorising and when to leave Python
More python and data for quants questions
- A NumPy array is C-ordered. Which loop is faster: summing along rows or along columns?Advanced · Premium
- You test x in container millions of times against a fixed collection of 100,000 ids.Foundation · Premium
- Profiling shows 60% of runtime in one function.Applied · Premium
- A backtest computes pnl = signal * returns, where both are indexed by day. What is wrong?Applied · Free solution
- You need the quote in force at the instant of each trade. Which join?Applied · Free solution
- What is sum([i * j for i in range(3) for j in range(3) if i != j])?Foundation · Premium