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 4, 2026 05:19olliecrowolliecrowScore: 12,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 05:1912,150126,070,97297,622,0002,012,0002,453,504
2Mar 4, 2026 05:1912,173129,332,51196,825,0002,994,0002,379,776
3Mar 4, 2026 05:1912,189125,901,11097,948,0001,998,0002,400,256