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 listApr 19, 2024 18:03Joad NacerJoad NacerScore: 93,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2024 18:0377,293699,486,246633,804,68802,301,952
2Apr 19, 2024 18:0393,938822,473,102770,289,40602,174,976
3Apr 19, 2024 18:0397,083855,580,517796,077,81402,301,952