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 listSep 3, 2024 16:20AnSaAnSaScore: 126,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 16:2089,140762,761,316603,130,000127,815,0002,498,560
2Sep 3, 2024 16:20126,4931,065,445,445924,328,000112,918,0002,494,464
3Sep 3, 2024 16:20151,1121,268,218,1021,121,205,000117,916,0002,277,376