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 14:38Dominique GarmierDominique GarmierScore: 10,097Success
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 14:2910,050108,024,00981,407,0001,005,0002,383,872
2Mar 23, 2026 14:2910,063109,106,82181,514,0001,006,0002,379,776
3Mar 23, 2026 14:3810,089110,307,93380,736,0001,993,0002,273,280
4Mar 23, 2026 14:2910,097112,268,39581,797,000997,0002,273,280
5Mar 23, 2026 14:3813,042131,473,067105,944,000999,0002,387,968
6Mar 23, 2026 14:3813,068131,358,505105,152,0002,002,0002,387,968