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 12:07Dominique GarmierDominique GarmierScore: 95,128Success
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 12:0794,287796,151,436635,302,000137,848,0002,273,280
2Mar 24, 2026 12:0795,128805,162,481625,238,000154,811,0002,461,696
3Mar 24, 2026 12:07105,930899,528,474732,841,000135,785,0002,428,928