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 listJun 19, 2021 19:54alex3dalex3dScore: 117,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 19:5498,071861,372,985804,182,73502,285,568
2Jun 19, 2021 19:54117,3081,018,971,764961,928,14402,277,376
3Jun 19, 2021 19:54120,0431,040,030,974984,349,72902,293,760