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 24, 2026 04:23Dominique GarmierDominique GarmierScore: 10,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 07:0210,492111,267,27584,034,0002,000,0002,420,736
2Mar 24, 2026 04:5210,525110,172,03186,304,00002,412,544
3Mar 24, 2026 04:2310,526113,604,98684,307,0002,007,0002,363,392
4Mar 24, 2026 04:5210,527106,696,30184,312,0002,007,0002,416,640
5Mar 24, 2026 07:0210,536110,704,32785,389,0001,004,0002,338,816
6Mar 24, 2026 04:2310,537108,542,52686,402,00002,383,872
7Mar 24, 2026 04:2310,546107,196,78986,481,00002,506,752
8Mar 24, 2026 04:5210,578113,388,03385,745,000997,0002,502,656
9Mar 24, 2026 07:0210,590110,003,09284,846,0001,996,0002,408,448