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 listJan 12, 2024 22:34cashkarucashkaruScore: 985,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2024 22:34983,5498,121,400,7948,065,100,61902,293,760
2Jan 12, 2024 22:34985,5178,142,916,7948,081,240,01202,293,760
3Jan 12, 2024 22:34989,3998,175,168,4138,113,070,45602,285,568