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 25, 2026 13:17Dominique GarmierDominique GarmierScore: 37,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 13:1737,205334,393,694215,058,00090,024,0002,293,760
2Mar 25, 2026 13:1737,567330,405,394214,036,00094,016,0002,289,664
3Mar 25, 2026 13:1738,004342,574,688213,436,00098,200,0002,269,184