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 23, 2026 19:30Victor MerckléVictor MerckléScore: 5,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:312,98532,903,75123,399,0001,083,0002,117,632stderr
2Aug 23, 2026 19:312,99132,847,29123,447,0001,083,0002,117,632stderr
3Aug 23, 2026 19:313,03633,244,85023,885,0001,017,0002,117,632stderr
4Aug 23, 2026 19:313,06434,158,68624,107,0001,024,0002,117,632stderr
5Aug 23, 2026 19:315,69755,052,80945,586,0001,132,0002,117,632stderr
6Aug 23, 2026 19:3114,435126,693,505117,314,0001,058,0002,117,632stderr
7Aug 23, 2026 19:3114,442126,801,671117,386,0001,042,0002,117,632stderr
8Aug 23, 2026 19:3114,451126,869,416117,353,0001,146,0002,117,632stderr
9Aug 23, 2026 19:3115,409135,179,363125,353,0001,008,0002,117,632stderr