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 03:53olliecrowolliecrowScore: 23,026Success
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 03:533,33453,119,26525,311,0002,024,0002,510,848
2Mar 20, 2026 03:533,33854,451,67227,371,00002,277,376
3Mar 20, 2026 03:533,34550,660,52926,416,0001,016,0002,506,752
4Mar 20, 2026 03:533,37057,926,95827,631,00002,428,928
5Mar 20, 2026 03:5323,026214,543,628185,818,0002,997,0002,265,088
6Mar 20, 2026 03:5323,058216,703,212186,073,0003,001,0002,473,984
7Mar 20, 2026 03:5323,072214,773,701186,186,0003,003,0002,338,816
8Mar 20, 2026 03:5323,085212,129,901185,288,0004,006,0002,494,464
9Mar 20, 2026 03:5323,149214,706,506186,824,0002,997,0002,273,280