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 listAug 21, 2024 13:52GabriellaGabriellaScore: 269,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2024 13:52269,3572,262,118,1432,208,723,88402,289,664
2Aug 21, 2024 13:52269,6412,275,919,5272,211,055,01602,289,664
3Aug 21, 2024 13:52270,0352,286,486,2562,214,283,68102,306,048