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:38limanjun99limanjun99Score: 104,410Success
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:38103,193870,324,488712,314,000133,871,0002,285,568
2Mar 18, 2026 04:38104,410881,835,547730,288,000125,877,0002,297,856
3Mar 18, 2026 04:38108,976921,502,809771,657,000121,945,0002,318,336