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 18, 2026 04:39limanjun99limanjun99Score: 95,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 04:3990,598776,904,636609,924,000132,983,0002,285,568
2Mar 18, 2026 04:3995,823814,639,916651,793,000133,957,0002,404,352
3Mar 18, 2026 04:39108,851915,356,746764,641,000127,940,0002,293,760