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 13, 2023 09:13gchebanovgchebanovScore: 1,013,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 09:131,008,4468,343,045,3058,269,254,17802,289,664
2Jul 13, 2023 09:131,013,0048,365,800,1308,306,629,47302,277,376
3Jul 13, 2023 09:131,013,7208,382,527,9638,312,502,06202,281,472