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 17:00Dominique GarmierDominique GarmierScore: 23,745Success
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 17:0023,741223,111,087191,685,0002,995,0002,396,160
2Mar 24, 2026 17:0023,745225,818,197194,706,00002,355,200
3Mar 24, 2026 17:0023,769218,433,276192,910,0001,999,0002,334,720