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 21, 2026 22:18Dominique GarmierDominique GarmierScore: 24,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 22:1824,952234,016,570106,793,00097,810,0002,330,624
2Mar 21, 2026 22:1824,961231,654,055106,834,00097,848,0002,433,024
3Mar 21, 2026 22:1825,092234,534,847105,873,00099,880,0002,371,584