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 listMar 24, 2026 07:27Dominique GarmierDominique GarmierScore: 103,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 07:2794,240798,381,681637,806,000134,959,0002,289,664
2Mar 24, 2026 07:27103,710878,480,210711,518,000138,906,0002,359,296
3Mar 24, 2026 07:27104,848889,550,606725,794,000133,962,0002,314,240