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:43zielajzielajError
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:4200000Error: Exit with code 1: not a dynamic executable 67760 32129 35022 2168534460 757584 375596 381984 2168546983 2168546983 5000000 2163546983 2173546983 99999744 100000000 2163546983 2173546983 50000000 100000000 2163546983 2173546983 49761701 208465 2...stderr
2Oct 19, 2024 17:4700000Error: No answer to stdout. Died or killed?stderr
3Oct 19, 2024 17:433,41156,111,40525,975,0001,998,0002,396,160
4Oct 19, 2024 17:433,44158,780,94626,198,0002,015,0002,387,968
5Oct 19, 2024 17:433,50356,060,17728,726,00002,494,464