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 13, 2024 22:12zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 22:1100000Error: Exit with code 1: not a dynamic executable 0 0 1932735283 2362232011 4679292 10704657 2091846679 2149112909 4643546 1304796 2091846679 2149112909 35746 1304796 2089597788 2097233284 0 123312 2089597788 2097233284 35746 123312 2091302152 209232...stderr
2Oct 13, 2024 22:126,57080,259,28541,902,00011,972,0002,461,696
3Oct 13, 2024 22:126,58277,467,14141,980,00011,994,0002,457,600
4Oct 13, 2024 22:126,61375,488,70245,186,0009,037,0002,375,680
5Oct 13, 2024 22:126,62783,346,52745,282,0009,056,0002,482,176
6Oct 13, 2024 22:126,70977,114,11940,009,00015,003,0002,322,432
7Oct 13, 2024 22:126,74974,080,23536,225,00019,119,0002,531,328
8Oct 13, 2024 22:126,75078,186,27242,269,00013,083,0002,433,024
9Oct 13, 2024 22:126,76281,354,32042,343,00013,106,0002,523,136
10Oct 13, 2024 22:126,84882,282,38141,115,00015,042,0002,375,680