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 17:25Dominique GarmierDominique GarmierScore: 12,653Success
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 17:2512,634133,534,526102,596,0001,005,0002,416,640
2Mar 24, 2026 17:2512,653131,582,876101,757,0001,995,0002,265,088
3Mar 24, 2026 17:2512,658129,699,435101,799,0001,996,0002,490,368