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 30, 2026 13:27Dominique GarmierDominique GarmierScore: 13,092Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 13:2713,090131,373,511105,333,0002,006,0002,387,968
2Mar 30, 2026 13:2713,092129,261,927107,356,00002,514,944
3Mar 30, 2026 13:2713,131134,013,922107,675,00002,367,488