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 3, 2026 23:01olliecrowolliecrowScore: 24,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 23:0124,624231,601,428200,914,000999,0002,527,232
2Mar 3, 2026 23:0124,637234,601,847201,020,0001,000,0002,367,488
3Mar 3, 2026 23:0124,651229,331,054202,136,00002,387,968
4Mar 3, 2026 23:0124,654227,999,221200,162,0002,001,0002,375,680
5Mar 3, 2026 23:0124,655223,398,705202,175,00002,383,872
6Mar 3, 2026 23:0124,666227,692,092200,261,0002,002,0002,527,232
7Mar 3, 2026 23:0124,668228,875,633201,276,0001,001,0002,383,872
8Mar 3, 2026 23:0124,683233,059,798202,402,00002,379,776
9Mar 3, 2026 23:0124,689229,416,213201,452,000997,0002,383,872