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 15, 2024 00:15zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 00:1700000Error: Exit with code 1: not a dynamic executable 0 4294967295 50000000 100000000 2024770296 2270196998 43806928 5663440stderr
2Oct 15, 2024 00:154,93262,579,64633,364,0007,077,0002,334,720
3Oct 15, 2024 00:154,94466,973,23034,459,0006,081,0002,453,504
4Oct 15, 2024 00:155,16869,237,58432,288,00010,090,0002,281,472