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 listMar 4, 2026 00:29olliecrowolliecrowScore: 12,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:2912,446131,879,505101,059,0001,000,0002,506,752
2Mar 4, 2026 00:2912,448124,821,903100,070,0002,001,0002,449,408
3Mar 4, 2026 00:2912,449128,520,757100,080,0002,001,0002,441,216
4Mar 4, 2026 00:2912,453127,435,465101,112,0001,001,0002,494,464
5Mar 4, 2026 00:2912,458126,032,024100,151,0002,003,0002,449,408
6Mar 4, 2026 00:2912,462127,083,81298,181,0004,007,0002,502,656
7Mar 4, 2026 00:2912,491125,617,722100,421,0002,008,0002,465,792
8Mar 4, 2026 00:2912,502129,743,465101,508,0001,005,0002,502,656
9Mar 4, 2026 00:2927,907251,797,533227,840,000999,0002,404,352