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 23, 2026 15:16Dominique GarmierDominique GarmierScore: 10,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 15:1610,093108,757,71280,770,0001,994,0002,527,232
2Mar 23, 2026 15:1610,134110,513,69981,100,0002,002,0002,347,008
3Mar 23, 2026 15:1610,151110,328,67780,228,0003,008,0002,371,584