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 28, 2026 19:19Dominique GarmierDominique GarmierScore: 10,177Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 19:197,32983,611,10859,098,0001,001,0002,293,760
2Mar 28, 2026 19:1910,177107,556,92382,447,0001,005,0002,396,160
3Mar 28, 2026 19:1910,214108,017,32580,761,0002,991,0002,273,280