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.

Restrictions:30s256Mb 1 Score Packages
Back to listAug 16, 2026 23:14Tomislav TunkovicTomislav TunkovicScore: 159,836Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 13:50Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:24159,260100,712,74091,362,0001,009,00045,056
2Aug 17, 2026 05:24159,700100,989,13091,614,0001,012,00045,056
3Aug 17, 2026 05:24159,703100,995,15291,621,0001,007,00045,056
4Aug 17, 2026 05:24159,762101,099,84991,648,0001,014,00045,056
5Aug 17, 2026 05:24159,836101,075,79491,691,0001,014,00045,056
6Aug 17, 2026 05:24159,898101,127,64091,728,0001,013,00045,056
7Aug 17, 2026 05:24159,972101,231,35191,771,0001,013,00045,056
8Aug 17, 2026 05:24160,091101,297,86191,840,0001,013,00045,056
9Aug 17, 2026 05:24160,244101,269,21291,935,0001,007,00045,056