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 listFeb 19, 2026 12:55Aleksei ShahoikaAleksei ShahoikaScore: 84,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 12:554,36961,795,28335,827,00002,383,872
2Feb 19, 2026 12:5584,198712,595,175570,521,000119,899,0002,383,872
3Feb 19, 2026 12:5592,642781,473,881633,720,000125,944,0002,338,816