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 15, 2024 23:31zielajzielajScore: 136,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 23:31133,1341,120,917,144968,730,000122,965,0002,322,432
2Oct 15, 2024 23:31136,9551,152,505,287985,154,000137,881,0002,514,944
3Oct 15, 2024 23:31150,7541,265,208,9411,112,265,000123,918,0002,478,080