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 19, 2024 17:19zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2024 17:1500000Error: Exit with code 1: not a dynamic executable 67760 33015 36058 2104335438 757584 373226 380119 2116634872 2116634872 5000000 2111634872 2121634872 99999744 100000000 2111634872 2121634872 50000000 100000000 2111634872 2121634872 50003519 229201 4...stderr
2Oct 19, 2024 17:3500000Error: No answer to stdout. Died or killed?stderr
3Oct 19, 2024 17:364,71367,512,73437,632,0001,017,0002,293,760
4Oct 19, 2024 17:365,73873,415,71844,048,0003,003,0002,506,752
5Oct 19, 2024 17:195,99068,959,22547,115,0002,004,0002,400,256
6Oct 19, 2024 17:366,01075,579,09748,279,0001,005,0002,494,464
7Oct 19, 2024 17:196,19878,687,82749,825,000996,0002,396,160
8Oct 19, 2024 17:196,24972,723,91948,228,0003,014,0002,387,968