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 19:38zielajzielajError
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 19:3700000Error: Exit with code 1: not a dynamic executable 67760 33407 36453 2078540772 1250000 618306 629604 2082240541 2082240541 3000000 2079240541 2085240541 99999744 100000000 2079240541 2085240541 50000000 100000000 2079240541 2085240541 49998018 133619 ...stderr
2Oct 19, 2024 19:382,99547,963,06923,534,0001,023,0002,523,136
3Oct 19, 2024 19:382,99546,249,15523,537,0001,023,0002,519,040
4Oct 19, 2024 19:383,03254,217,78024,864,00002,510,848