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 listJul 16, 2023 19:49Yuriy LyfenkoYuriy LyfenkoScore: 6,376Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 19:496,340620,942,04651,984,69902,285,568
2Jul 16, 2023 19:496,376615,754,52752,279,65102,260,992
3Jul 16, 2023 19:496,550633,803,58153,709,56902,273,280