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 listJan 13, 2024 00:09cashkarucashkaruScore: 975,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2024 00:09975,1598,061,191,9307,996,304,07302,301,952
2Jan 13, 2024 00:09975,3868,058,853,1227,998,166,01202,301,952
3Jan 13, 2024 00:09979,0278,088,603,2148,028,021,57502,293,760