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 28, 2026 21:28Dominique GarmierDominique GarmierScore: 10,268Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 21:287,32585,258,08058,067,0002,002,0002,412,544
2Mar 28, 2026 21:2810,268109,049,90981,194,0003,007,0002,392,064
3Mar 28, 2026 21:2810,279112,966,48282,279,0002,006,0002,412,544