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 listMay 15, 2023 13:19Martin StensgårdMartin StensgårdError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2023 13:1900000Error: expected "2002070102 ", got "2002059264 "
2May 15, 2023 13:2000000Error: expected "2193985008 ", got "2193948672 "
3May 15, 2023 13:2000000Error: expected "2134989130 ", got "2134966272 "
4May 15, 2023 13:2100000Error: expected "2130400963 ", got "2130378752 "
5May 15, 2023 13:2100000Error: expected "2071746558 ", got "2071724032 "
6May 15, 2023 13:2200000Error: expected "2142414065 ", got "2142371840 "
7May 15, 2023 13:2200000Error: expected "2009524683 ", got "2009464832 "
8May 15, 2023 13:2300000Error: expected "2181331770 ", got "2181300224 "
9May 15, 2023 13:2400000Error: expected "2079022112 ", got "2078998528 "
10May 15, 2023 13:2400000Error: expected "2195559277 ", got "2195521536 "