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 27, 2026 08:25Dominique GarmierDominique GarmierScore: 12,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 08:2512,248125,085,52299,427,0001,004,0002,379,776
2Mar 27, 2026 08:2512,279126,275,39999,693,000996,0002,375,680
3Mar 27, 2026 08:2512,318131,321,97198,008,0003,000,0002,355,200