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 21:59olliecrowolliecrowScore: 3,586Success
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 21:593,54756,929,30727,083,0002,006,0002,457,600
2Mar 10, 2026 21:593,56156,508,70027,187,0002,013,0002,519,040
3Mar 10, 2026 21:593,57057,728,95327,257,0002,019,0002,363,392
4Mar 10, 2026 21:593,58151,382,24027,341,0002,025,0002,457,600
5Mar 10, 2026 21:593,58654,255,13726,365,0003,042,0002,502,656
6Mar 10, 2026 21:593,65759,122,29327,988,0001,999,0002,445,312
7Mar 10, 2026 21:5918,399176,332,253146,877,0003,996,0002,433,024
8Mar 10, 2026 21:5918,569182,573,960150,263,0002,003,0002,416,640
9Mar 10, 2026 21:5918,596183,421,398148,505,0003,986,0002,318,336