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 listOct 18, 2024 17:16Sybrand AarnoutseSybrand AarnoutseScore: 322,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2024 17:16321,9082,670,301,8252,515,760,000123,889,0002,457,600
2Oct 18, 2024 17:16322,3742,671,029,6802,525,581,000117,887,0002,519,040
3Oct 18, 2024 17:16322,3952,669,938,4672,511,753,000131,882,0002,289,664