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 listApr 20, 2024 00:45Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2024 00:4500000Error: expected "2098964604 ", got "2098964658"
2Apr 20, 2024 00:4600000Error: expected "2083954056 ", got "2083954004"
3Apr 20, 2024 00:4700000Error: expected "2143408345 ", got "2143408336"
4Apr 20, 2024 00:4800000Error: No answer to stdout. Died or killed?