Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJan 9, 2025 08:10Ian MckibbenIan MckibbenScore: 101,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 08:1094,442804,251,375580,567,000193,855,0002,314,240
2Jan 9, 2025 08:1098,932838,338,077622,420,000188,824,0002,359,296
3Jan 9, 2025 08:1099,487844,686,800610,845,000204,948,0002,281,472
4Jan 9, 2025 08:1099,989847,764,046626,167,000193,742,0002,465,792
5Jan 9, 2025 08:10101,319858,036,086628,859,000201,954,0002,506,752
6Jan 9, 2025 08:10109,664924,342,319710,406,000188,842,0002,306,048
7Jan 9, 2025 08:10117,188986,969,633778,140,000182,798,0002,297,856
8Jan 9, 2025 08:10117,757986,474,609772,687,000192,922,0002,310,144
9Jan 9, 2025 08:10123,0601,048,223,673815,268,000193,826,0002,269,184