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 17:12Dominique GarmierDominique GarmierScore: 209,902Success
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 17:12208,0371,727,868,2791,703,902,0001,998,0002,347,008
2Mar 25, 2026 17:12209,9021,745,655,2031,719,200,0001,999,0002,281,472
3Mar 25, 2026 17:12210,3581,752,306,7031,721,939,0002,996,0002,277,376