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 25, 2026 16:06C#_userC#_userScore: 1,284,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 16:061,269,081745,952,568733,988,0002,079,0002,113,536
2Aug 25, 2026 16:061,278,279751,415,504739,237,0002,165,0002,113,536
3Aug 25, 2026 16:061,280,389752,584,041740,517,0002,109,0002,113,536
4Aug 25, 2026 16:061,284,384754,919,775742,812,0002,131,0002,113,536
5Aug 25, 2026 16:061,284,641755,067,513742,957,0002,135,0002,113,536
6Aug 25, 2026 16:061,285,868755,718,429743,681,0002,123,0002,113,536
7Aug 25, 2026 16:061,305,281769,173,583754,899,0002,164,0002,113,536
8Aug 25, 2026 16:061,308,427769,583,730756,885,0002,003,0002,113,536
9Aug 25, 2026 16:061,314,148772,801,963759,987,0002,219,0002,113,536