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 28, 2024 15:57emily graceemily graceScore: 102,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2024 15:5769,937635,636,841573,481,05402,289,664
2Mar 28, 2024 15:57102,476903,840,922840,303,12402,297,856
3Mar 28, 2024 15:57113,345986,428,919929,432,35902,187,264