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 21, 2024 07:06Huy Duc LeHuy Duc LeScore: 16,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 07:0616,290189,027,935133,574,38002,207,744
2Feb 21, 2024 07:0616,821192,639,261137,929,80002,195,456
3Feb 21, 2024 07:0617,458208,370,852143,154,10502,191,360