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:56Aleksei ShahoikaAleksei ShahoikaScore: 95,085Success
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:564,61370,564,92333,847,0003,982,0002,379,776
2Feb 19, 2026 12:5695,085807,398,381661,740,000117,953,0002,342,912
3Feb 19, 2026 12:56104,990882,443,449731,081,000129,836,0002,338,816