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 listOct 18, 2024 17:46Sybrand AarnoutseSybrand AarnoutseScore: 412,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2024 17:46231,7672,479,015,4871,077,743,000822,750,0002,469,888
2Oct 18, 2024 17:46412,1408,926,921,2761,381,197,0001,998,350,0002,445,312
3Oct 18, 2024 17:46538,29910,191,059,7001,795,953,0002,618,101,0002,482,176