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 22, 2026 14:56Dominique GarmierDominique GarmierScore: 22,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 14:5622,149207,316,594179,625,0001,995,0002,506,752
2Mar 22, 2026 14:5622,230206,609,668182,283,00002,293,760
3Mar 22, 2026 14:5622,239215,732,513181,359,0001,001,0002,293,760