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 listDec 25, 2024 19:55Joad NacerJoad NacerScore: 3,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 19:553,67049,101,75327,083,0003,009,0002,502,656
2Dec 25, 2024 19:553,68951,146,08428,233,0002,016,0002,269,184
3Dec 25, 2024 19:553,69459,047,17727,265,0003,029,0002,527,232