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 listJan 16, 2025 00:02Ian MckibbenIan MckibbenScore: 12,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 00:0212,174122,117,64898,831,000998,0002,457,600
2Jan 16, 2025 00:0212,185124,523,08397,920,0001,998,0002,449,408
3Jan 16, 2025 00:0212,186122,909,77697,927,0001,998,0002,412,544
4Jan 16, 2025 00:0212,211121,989,18899,128,0001,001,0002,428,928
5Jan 16, 2025 00:0212,214128,715,84898,153,0002,003,0002,465,792
6Jan 16, 2025 00:0212,224125,515,40798,229,0002,004,0002,428,928
7Jan 16, 2025 00:0212,232121,049,52899,297,0001,003,0002,506,752
8Jan 16, 2025 00:0212,234122,002,98998,311,0002,006,0002,453,504
9Jan 16, 2025 00:0212,291127,365,55099,789,000997,0002,465,792