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 listAug 14, 2026 15:28marko1597marko1597Score: 517,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 15:38517,1384,250,475,7014,232,133,0008,403,0002,121,728stderr
2Aug 14, 2026 15:38517,9084,256,995,1544,238,582,0008,268,0002,121,728stderr
3Aug 14, 2026 15:38518,5744,262,225,5284,243,924,0008,389,0002,121,728stderr