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 listApr 13, 2025 16:55yenw0dyenw0dError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2025 16:5400000Error: expected "2785585 ", got "0 "
2Apr 13, 2025 16:5400000Error: expected "2281576 ", got "0 "
3Apr 13, 2025 16:5564,33363,908,03537,313,00002,502,656
4Apr 13, 2025 16:5568,33374,214,39838,617,0001,016,0002,494,464
5Apr 13, 2025 16:5568,81765,890,53838,917,000997,0002,519,040
6Apr 13, 2025 16:5569,04066,187,34538,041,0002,002,0002,510,848
7Apr 13, 2025 16:5569,13166,172,94538,092,0002,004,0002,510,848
8Apr 13, 2025 16:5569,29364,902,93539,186,0001,004,0002,449,408
9Apr 13, 2025 16:5569,48864,010,80538,288,0002,015,0002,510,848
10Apr 13, 2025 16:5570,13365,206,65139,661,0001,016,0002,457,600
11Apr 13, 2025 16:5570,41268,353,31238,847,0001,992,0002,523,136