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 listNov 1, 2021 09:59Jules MinierJules MinierScore: 98,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2021 09:5997,800861,455,072801,960,90702,269,184
2Nov 1, 2021 09:5998,073869,448,099804,201,33502,252,800
3Nov 1, 2021 09:5998,375872,777,049806,675,32302,265,088