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 19, 2024 10:40Joad NacerJoad NacerScore: 980,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2024 10:40973,2208,033,194,5727,980,403,96402,289,664
2Apr 19, 2024 10:40980,1008,089,499,9178,036,820,60502,289,664
3Apr 19, 2024 10:40981,6978,109,642,9028,049,917,88002,281,472