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 listMay 17, 2024 19:39Joad NacerJoad NacerScore: 46,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2024 19:3944,962422,052,129368,685,05402,179,072
2May 17, 2024 19:3946,017444,907,090377,338,27002,203,648
3May 17, 2024 19:3947,631468,037,000390,572,58802,236,416