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 listOct 2, 2026 22:57Karthik ReddyKarthik ReddyScore: 3,000Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 20:43Andrew Epstein13.13CustomSolution Held
Oct 5, 2026 17:56Andrew Epstein13.13CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 22:592,9606,033,582,33623,249,0001,026,00020,480
2Oct 2, 2026 22:592,9936,033,986,09223,489,0001,055,00020,480
3Oct 2, 2026 22:592,9936,033,741,82223,502,0001,045,00020,480
4Oct 2, 2026 22:593,0006,033,859,73623,582,0001,021,00020,480
5Oct 2, 2026 22:593,0006,033,912,96623,529,0001,076,00020,480
6Oct 2, 2026 22:593,0486,034,241,24623,979,0001,015,00020,480
7Oct 2, 2026 22:593,0896,034,524,32224,274,0001,057,00020,480
8Oct 2, 2026 22:593,1446,035,053,84424,638,0001,146,00020,480
9Oct 2, 2026 22:5931,8286,270,356,416259,866,0001,124,00020,480