Order book Yuriy Lyfenko

Simulate a sell-side order book and calculate the cost of a final purchase as fast as possible.

Input

1,000,000 order updates on STDIN, one per line:

  • + <price> <size> – add a new sell order
  • - <position> – delete the order at the given position
  • = <size> – buy <size> shares from the top of the order book

After all updates are processed, buy 1,000 shares from the top of the order book.

Output

Print the total cost of the final 1,000-share purchase to STDOUT.

Order Book Rules

Orders are sorted by price ascending (lower is better). Orders at the same price are sorted by arrival time (earlier first). Position 0 is the best (lowest-price) offer.

The = (buy) operation consumes shares starting from position 0. If an order is fully consumed, it is removed from the book.

Example

Input Order book state
+ 1137 100 (1137,100)
+ 1130 10 (1130,10), (1137,100)
+ 1130 50 (1130,10), (1130,50), (1137,100)
- 0 (1130,50), (1137,100)
+ 1150 200 (1130,50), (1137,100), (1150,200)
= 200 (1150,150)

Total cost of the last buy: 50 * 1130 + 100 * 1137 + 50 * 1150.

Back to listMar 23, 2026 22:36DmtryDmtryError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 5, 2026 16:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 16:4909,689,4601,892,00002,113,536expected "999999000 ", got "0 "
2Jul 5, 2026 16:4909,695,4051,892,00002,113,536expected "999999000 ", got "0 "
3Jul 5, 2026 16:4909,683,8201,902,00002,113,536expected "999999000 ", got "0 "
4Mar 23, 2026 22:345,11718,549,6011,979,000989,0002,465,792
5Mar 23, 2026 22:365,12215,200,9511,981,000990,0002,453,504
6Mar 23, 2026 22:345,16221,385,905998,0001,996,0002,469,888
7Mar 23, 2026 22:345,17416,407,0712,001,0001,000,0002,449,408
8Mar 23, 2026 22:365,35318,308,8382,070,0001,035,0002,453,504
9Mar 23, 2026 22:365,42219,846,3042,097,0001,048,0002,457,600