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 22, 2026 09:48Dominique GarmierDominique GarmierScore: 68,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 09:4968,533588,244,237559,972,0001,996,0002,314,240
2Mar 22, 2026 09:4868,545593,862,498560,077,0001,996,0002,334,720
3Mar 22, 2026 09:4968,619587,399,557560,677,0001,995,0002,334,720
4Mar 22, 2026 09:4868,771596,508,702562,925,000999,0002,473,984
5Mar 22, 2026 09:4869,245591,837,690565,816,0001,995,0002,334,720
6Mar 22, 2026 09:4969,495599,873,326560,861,0008,997,0002,523,136