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 14, 2024 01:21zielajzielajScore: 359,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 01:21357,2752,955,482,1172,919,676,0009,978,0002,449,408
2Oct 14, 2024 01:21359,1282,973,969,4112,934,873,0009,979,0002,400,256
3Oct 14, 2024 01:21361,4072,992,759,8982,955,555,0007,982,0002,306,048