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 23:31emily graceemily graceScore: 105,986Success
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 23:3174,978674,837,479614,823,10602,301,952
2Mar 27, 2024 23:31105,986937,544,429869,086,79102,293,760
3Mar 27, 2024 23:31117,4701,035,806,246963,257,37202,187,264