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 27, 2023 23:46apuxbtapuxbtScore: 113,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2023 23:46112,759995,917,537924,620,87702,273,280
2Sep 27, 2023 23:46113,388985,572,487929,778,46702,265,088
3Sep 27, 2023 23:46125,8821,098,260,4711,032,230,87302,260,992