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 29, 2026 00:43Dominique GarmierDominique GarmierScore: 21,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 06:0321,391203,641,908172,397,0003,006,0002,473,984
2Mar 29, 2026 00:4321,401200,245,261174,487,0001,002,0002,383,872
3Mar 29, 2026 06:0321,430198,211,513170,734,0004,992,0002,334,720
4Mar 29, 2026 00:4321,465198,922,724172,014,0004,000,0002,293,760
5Mar 29, 2026 06:0321,551208,065,078172,728,0003,993,0002,396,160
6Mar 29, 2026 00:4321,640208,341,366174,444,0003,007,0002,465,792