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 10, 2026 05:06olliecrowolliecrowScore: 12,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 05:0611,979125,146,67695,224,0003,007,0002,469,888
2Mar 10, 2026 05:0611,989124,135,89398,309,00002,412,544
3Mar 10, 2026 05:0611,994127,176,33697,344,0001,003,0002,424,832
4Mar 10, 2026 05:0612,003122,217,01497,419,0001,004,0002,404,352
5Mar 10, 2026 05:0612,004118,704,13097,429,0001,004,0002,424,832
6Mar 10, 2026 05:0612,006121,367,13698,449,00002,416,640
7Mar 10, 2026 05:0612,016124,620,09697,526,0001,005,0002,469,888
8Mar 10, 2026 05:0612,031126,025,96097,658,000996,0002,416,640
9Mar 10, 2026 05:0612,119124,001,56698,369,0001,003,0002,428,928