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 26, 2026 23:13Dominique GarmierDominique GarmierScore: 9,644Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 23:139,626106,573,86477,937,000999,0002,547,712
2Mar 26, 2026 23:139,644102,381,66777,081,0002,002,0002,416,640
3Mar 26, 2026 23:139,691111,662,33877,459,0002,011,0002,392,064