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 listSep 20, 2022 05:03Kenneth MaplesKenneth MaplesScore: 68,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2022 05:0136,963363,394,171303,100,08202,207,744
2Sep 20, 2022 05:0359,512548,413,603487,998,16702,269,184
3Sep 20, 2022 05:0360,333566,724,998494,733,94602,260,992
4Sep 20, 2022 05:0163,912599,038,948524,074,30802,211,840
5Sep 20, 2022 05:0368,674630,301,161563,129,05702,269,184
6Sep 20, 2022 05:0368,966623,137,295565,521,91302,211,840
7Sep 20, 2022 05:0371,944648,898,347589,940,75502,260,992
8Sep 20, 2022 05:0171,976640,501,533590,203,10602,265,088
9Sep 20, 2022 05:0377,497695,239,723635,475,25602,273,280