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 27, 2024 22:40emily graceemily graceScore: 109,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 22:40100,586879,639,675824,807,03202,174,976
2Mar 27, 2024 22:40109,072953,769,252894,392,14602,244,608
3Mar 27, 2024 22:40124,3491,085,174,8991,019,659,62502,297,856