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 00:04zielajzielajScore: 5,116Success
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 00:045,10273,662,16734,867,0006,973,0002,478,080
2Oct 15, 2024 00:045,11664,419,97431,961,0009,987,0002,355,200
3Oct 15, 2024 00:045,97371,627,39736,983,00011,994,0002,424,832