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 23, 2026 20:37Dominique GarmierDominique GarmierScore: 9,547Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 20:379,504106,862,99876,930,000999,0002,392,064
2Mar 23, 2026 20:379,547105,299,04075,276,0003,011,0002,289,664
3Mar 23, 2026 20:379,552104,616,07074,312,0004,016,0002,367,488