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 listAug 29, 2026 12:00Victor MerckléVictor MerckléScore: 5,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 12:012,72830,786,86221,279,0001,098,0002,117,632stderr
2Aug 29, 2026 12:012,73330,732,75921,317,0001,099,0002,117,632stderr
3Aug 29, 2026 12:012,74330,639,66921,394,0001,102,0002,117,632stderr
4Aug 29, 2026 12:012,77131,103,40521,649,0001,079,0002,117,632stderr
5Aug 29, 2026 12:015,35752,052,45642,891,0001,037,0002,117,632stderr
6Aug 29, 2026 12:015,37752,399,61743,063,0001,030,0002,117,632stderr
7Aug 29, 2026 12:015,39752,360,57743,218,0001,040,0002,117,632stderr
8Aug 29, 2026 12:015,40552,487,04543,175,0001,151,0002,117,632stderr
9Aug 29, 2026 12:015,44753,022,47443,522,0001,148,0002,117,632stderr