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 10:03Jules MinierJules MinierScore: 98,573Success
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 10:0398,145868,666,443804,787,52602,273,280
2Nov 1, 2021 10:0398,573872,559,910808,297,26302,256,896
3Nov 1, 2021 10:0398,936876,247,687811,277,11602,277,376