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 20, 2026 02:42Dominique GarmierDominique GarmierScore: 12,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 02:3512,841133,526,984103,293,0002,005,0002,465,792
2Mar 20, 2026 02:3512,878133,423,660104,591,0001,005,0002,416,640
3Mar 20, 2026 03:0412,891131,705,385105,707,00002,351,104
4Mar 20, 2026 03:0412,899130,204,532104,771,000997,0002,367,488
5Mar 20, 2026 02:3512,935135,914,786102,069,0004,002,0002,338,816
6Mar 20, 2026 02:4212,989132,748,548105,503,0001,004,0002,412,544
7Mar 20, 2026 02:4213,011132,561,047104,695,0001,994,0002,342,912
8Mar 20, 2026 03:0413,020132,896,982104,773,0001,995,0002,408,448
9Mar 20, 2026 02:4213,061133,048,068105,099,0002,001,0002,347,008