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 14, 2026 21:51Elijah KinElijah KinScore: 70,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 21:5170,387600,489,250389,443,000187,731,0002,314,240
2Mar 14, 2026 21:5170,611607,969,622389,333,000189,675,0002,392,064
3Mar 14, 2026 21:5170,764613,539,457384,514,000195,752,0002,285,568