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 listFeb 22, 2024 11:03Huy Duc LeHuy Duc LeScore: 8,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 11:037,937127,053,20965,082,91202,232,320
2Feb 22, 2024 11:038,966125,650,83073,521,95102,207,744
3Feb 22, 2024 11:0310,039142,859,19582,322,34202,183,168