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 14:19Martin StensgårdMartin StensgårdScore: 371,619Success
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 14:19368,6399,163,283,2393,022,836,94702,236,416
2May 15, 2023 14:19371,61912,051,122,1663,047,277,21802,256,896
3May 15, 2023 14:19373,16911,123,008,6223,059,989,41202,240,512