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 listOct 15, 2024 23:38zielajzielajScore: 102,395Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 23:38100,878851,813,705699,324,000127,876,0002,469,888
2Oct 15, 2024 23:38102,395868,627,895708,697,000130,944,0002,273,280
3Oct 15, 2024 23:38103,195872,744,978715,326,000130,876,0002,473,984