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 28, 2026 13:10Dominique GarmierDominique GarmierScore: 10,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 13:1010,617111,629,83384,057,0003,002,0002,322,432
2Mar 28, 2026 13:1010,643112,545,57284,262,0003,009,0002,351,104
3Mar 28, 2026 13:1010,712117,110,78585,845,0001,996,0002,400,256