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 29, 2021 15:15alex3dalex3dScore: 184,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 15:15172,7861,476,985,1991,416,846,19702,285,568
2Jun 29, 2021 15:15184,7371,575,128,1121,514,845,79602,289,664
3Jun 29, 2021 15:15185,7591,588,153,6151,523,225,00902,273,280