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 3, 2026 23:16olliecrowolliecrowScore: 90,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:1672,924630,500,397422,278,000175,699,0002,371,584
2Mar 3, 2026 23:1690,507770,049,745568,356,000173,803,0002,297,856
3Mar 3, 2026 23:16105,406887,110,910687,467,000176,863,0002,494,464