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 3, 2026 04:55Josu San MartinJosu San MartinScore: 419,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 04:55419,43010,699,116,4631,340,718,0002,098,604,000278,528
2Mar 3, 2026 04:55419,4739,867,249,2461,382,357,0002,057,321,000360,448
3Mar 3, 2026 04:55420,2879,742,198,3151,367,215,0002,079,138,000278,528