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 13, 2026 11:20Dominique GarmierDominique GarmierScore: 92,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 11:2068,202583,413,483421,438,000137,816,0002,514,944
2Mar 13, 2026 11:2076,540647,338,194483,717,000143,915,0002,408,448
3Mar 13, 2026 11:2083,019709,410,921542,807,000137,951,0002,301,952
4Mar 13, 2026 11:2084,598715,922,582552,767,000140,940,0002,412,544
5Mar 13, 2026 11:2092,433789,383,789616,147,000141,803,0002,314,240
6Mar 13, 2026 11:2097,836827,503,112662,383,000139,869,0002,260,992
7Mar 13, 2026 11:2098,280834,556,505664,913,000140,981,0002,293,760
8Mar 13, 2026 11:20101,827866,026,819698,149,000136,833,0002,469,888
9Mar 13, 2026 11:20107,643912,143,999734,729,000147,945,0002,310,144