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 07:25Dominique GarmierDominique GarmierScore: 17,812Success
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 07:2517,544171,216,743137,870,0005,994,0002,498,560
2Mar 25, 2026 07:2517,812172,449,381136,055,00010,004,0002,285,568
3Mar 25, 2026 07:2519,505186,693,434148,943,00010,995,0002,428,928