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 listOct 13, 2024 15:39zielajzielajScore: 15,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 15:3914,926146,062,998112,360,00010,032,0002,465,792
2Oct 13, 2024 15:3915,255151,261,007108,079,00017,012,0002,314,240
3Oct 13, 2024 15:3915,599151,476,749108,922,00018,986,0002,461,696