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 4, 2026 15:00olliecrowolliecrowScore: 12,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 15:0012,134125,753,63298,497,0001,005,0002,465,792
2Mar 4, 2026 15:0012,153127,764,83098,645,0001,006,0002,428,928
3Mar 4, 2026 15:0012,177126,422,03996,857,0002,995,0002,375,680