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 25, 2026 05:04Dominique GarmierDominique GarmierScore: 11,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 05:048,52093,532,25967,870,0001,996,0002,428,928
2Mar 25, 2026 05:0411,651129,874,98494,534,0001,005,0002,293,760
3Mar 25, 2026 05:0411,798123,727,45593,750,0002,992,0002,371,584