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 listApr 20, 2026 21:22olliecrowolliecrowScore: 12,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 21:2312,616132,216,636102,453,0001,004,0002,318,336
2Apr 20, 2026 21:2312,642131,334,100101,674,0001,993,0002,301,952
3Apr 20, 2026 21:2312,651136,179,982102,745,000997,0002,285,568