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 listMar 21, 2024 02:16IhebIhebScore: 1,003,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2024 02:161,001,6008,277,465,7738,213,119,34802,293,760
2Mar 21, 2024 02:161,003,6208,284,059,3418,229,681,94702,289,664
3Mar 21, 2024 02:161,005,9208,310,316,6758,248,543,80502,281,472