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 14, 2026 11:20Dominique GarmierDominique GarmierScore: 14,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:1914,096151,424,651115,587,00002,289,664
2Mar 15, 2026 21:3614,115142,410,710113,751,0001,995,0002,273,280
3Mar 15, 2026 21:3614,130146,569,482113,872,0001,997,0002,297,856
4Mar 17, 2026 14:1914,131146,346,176113,879,0001,997,0002,371,584
5Mar 14, 2026 11:2014,138143,517,340114,936,000999,0002,285,568
6Mar 14, 2026 11:2014,145141,625,794113,986,0001,999,0002,375,680
7Mar 17, 2026 14:1914,147141,732,687114,002,0002,000,0002,269,184
8Mar 15, 2026 21:3614,151141,583,168115,039,0001,000,0002,277,376
9Mar 14, 2026 11:2014,153144,446,383114,057,0002,001,0002,363,392